Base | Representation |
---|---|
bin | 11000000111111101110010… |
… | …101001010101010110110111 |
3 | 111220200002221022101001110002 |
4 | 120013331302221111112313 |
5 | 102401322311120113340 |
6 | 1013353521433221515 |
7 | 31230336212222531 |
oct | 3007756251252667 |
9 | 456602838331402 |
10 | 106100500551095 |
11 | 30896a73588116 |
12 | ba96ba2b6189b |
13 | 472830790134b |
14 | 1c2b41231c851 |
15 | c3edb68b8715 |
hex | 607f72a555b7 |
106100500551095 has 32 divisors (see below), whose sum is σ = 128704283285760. Its totient is φ = 83962452913920.
The previous prime is 106100500551077. The next prime is 106100500551139. The reversal of 106100500551095 is 590155005001601.
It is not a de Polignac number, because 106100500551095 - 222 = 106100496356791 is a prime.
It is a super-2 number, since 2×1061005005510952 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3598686224 + ... + 3598715706.
It is an arithmetic number, because the mean of its divisors is an integer number (4022008852680).
Almost surely, 2106100500551095 is an apocalyptic number.
106100500551095 is a deficient number, since it is larger than the sum of its proper divisors (22603782734665).
106100500551095 is a wasteful number, since it uses less digits than its factorization.
106100500551095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48335.
The product of its (nonzero) digits is 33750, while the sum is 38.
Adding to 106100500551095 its reverse (590155005001601), we get a palindrome (696255505552696).
The spelling of 106100500551095 in words is "one hundred six trillion, one hundred billion, five hundred million, five hundred fifty-one thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •