Base | Representation |
---|---|
bin | 10010101110110001… |
… | …101010000010011011 |
3 | 1220220122111122201211 |
4 | 102232301222002123 |
5 | 312142200401021 |
6 | 13123412323551 |
7 | 1311253134142 |
oct | 225661520233 |
9 | 56818448654 |
10 | 20112122011 |
11 | 859084aa43 |
12 | 3a936135b7 |
13 | 1b869a3b17 |
14 | d8b150759 |
15 | 7caa173e1 |
hex | 4aec6a09b |
20112122011 has 8 divisors (see below), whose sum is σ = 20472804000. Its totient is φ = 19754433600.
The previous prime is 20112121973. The next prime is 20112122087. The reversal of 20112122011 is 11022121102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20112122011 - 217 = 20111990939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20112121982 and 20112122000.
It is not an unprimeable number, because it can be changed into a prime (20112122111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 734836 + ... + 761713.
It is an arithmetic number, because the mean of its divisors is an integer number (2559100500).
Almost surely, 220112122011 is an apocalyptic number.
20112122011 is a deficient number, since it is larger than the sum of its proper divisors (360681989).
20112122011 is a wasteful number, since it uses less digits than its factorization.
20112122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1496789.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20112122011 its reverse (11022121102), we get a palindrome (31134243113).
Subtracting from 20112122011 its reverse (11022121102), we obtain a palindrome (9090000909).
The spelling of 20112122011 in words is "twenty billion, one hundred twelve million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •