Base | Representation |
---|---|
bin | 10010101000110100… |
… | …100001011101011011 |
3 | 1220122200111121020101 |
4 | 102220310201131123 |
5 | 311441111210021 |
6 | 13105443040231 |
7 | 1305630656413 |
oct | 225064413533 |
9 | 56580447211 |
10 | 20012210011 |
11 | 853a409642 |
12 | 3a66070077 |
13 | 1b6c0913b1 |
14 | d7bb83643 |
15 | 7c1d7da91 |
hex | 4a8d2175b |
20012210011 has 2 divisors, whose sum is σ = 20012210012. Its totient is φ = 20012210010.
The previous prime is 20012209913. The next prime is 20012210021. The reversal of 20012210011 is 11001221002.
It is an a-pointer prime, because the next prime (20012210021) can be obtained adding 20012210011 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20012210011 - 215 = 20012177243 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20012210011.
It is not a weakly prime, because it can be changed into another prime (20012210021) 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 as a sum of consecutive naturals, namely, 10006105005 + 10006105006.
It is an arithmetic number, because the mean of its divisors is an integer number (10006105006).
Almost surely, 220012210011 is an apocalyptic number.
20012210011 is a deficient number, since it is larger than the sum of its proper divisors (1).
20012210011 is an equidigital number, since it uses as much as digits as its factorization.
20012210011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20012210011 its reverse (11001221002), we get a palindrome (31013431013).
It can be divided in two parts, 2001221001 and 1, that added together give a palindrome (2001221002).
The spelling of 20012210011 in words is "twenty billion, twelve million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •