Base | Representation |
---|---|
bin | 1001000110001000110100… |
… | …01011110011101001010011 |
3 | 2121211011220212202011212102 |
4 | 10203010122023303221103 |
5 | 10110203301103001321 |
6 | 110312501103151015 |
7 | 4133050506516242 |
oct | 443043213635123 |
9 | 77734825664772 |
10 | 20002102000211 |
11 | 64119311419a1 |
12 | 22b065b5a546b |
13 | b21261922146 |
14 | 4d216d4a8959 |
15 | 24a479695c0b |
hex | 12311a2f3a53 |
20002102000211 has 4 divisors (see below), whose sum is σ = 20647331097024. Its totient is φ = 19356872903400.
The previous prime is 20002102000201. The next prime is 20002102000267. The reversal of 20002102000211 is 11200020120002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20002102000211 - 226 = 20002034891347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20002102000192 and 20002102000201.
It is not an unprimeable number, because it can be changed into a prime (20002102000201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 322614548360 + ... + 322614548421.
It is an arithmetic number, because the mean of its divisors is an integer number (5161832774256).
Almost surely, 220002102000211 is an apocalyptic number.
20002102000211 is a deficient number, since it is larger than the sum of its proper divisors (645229096813).
20002102000211 is an equidigital number, since it uses as much as digits as its factorization.
20002102000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645229096812.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 20002102000211 its reverse (11200020120002), we get a palindrome (31202122120213).
The spelling of 20002102000211 in words is "twenty trillion, two billion, one hundred two million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •