Base | Representation |
---|---|
bin | 10110101111010111011100… |
… | …011000111001010100100010 |
3 | 111010010001111000010121100010 |
4 | 112233113130120321110202 |
5 | 101102044044304013442 |
6 | 552412514504105350 |
7 | 30031425603025233 |
oct | 2657273430712442 |
9 | 433101430117303 |
10 | 100012011001122 |
11 | 299599459a2090 |
12 | b272bb8165256 |
13 | 43a612765cbbc |
14 | 1a9a87009508a |
15 | b8681deb4b9c |
hex | 5af5dc639522 |
100012011001122 has 32 divisors (see below), whose sum is σ = 225246992523264. Its totient is φ = 29329035483600.
The previous prime is 100012011001117. The next prime is 100012011001127. The reversal of 100012011001122 is 221100110210001.
It is an interprime number because it is at equal distance from previous prime (100012011001117) and next prime (100012011001127).
It is a junction number, because it is equal to n+sod(n) for n = 100012011001098 and 100012011001107.
It is not an unprimeable number, because it can be changed into a prime (100012011001127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24440860858 + ... + 24440864949.
It is an arithmetic number, because the mean of its divisors is an integer number (7038968516352).
Almost surely, 2100012011001122 is an apocalyptic number.
100012011001122 is an abundant number, since it is smaller than the sum of its proper divisors (125234981522142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100012011001122 is a wasteful number, since it uses less digits than its factorization.
100012011001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48881725854.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100012011001122 its reverse (221100110210001), we get a palindrome (321112121211123).
The spelling of 100012011001122 in words is "one hundred trillion, twelve billion, eleven million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •