Base | Representation |
---|---|
bin | 1001000110000111001010… |
… | …00001100011101110010111 |
3 | 2121211002121201112000202011 |
4 | 10203003211001203232113 |
5 | 10110144434242333421 |
6 | 110312232403125051 |
7 | 4133016426622522 |
oct | 443034501435627 |
9 | 77732551460664 |
10 | 20001210121111 |
11 | 6411513756a2a |
12 | 22b0450973787 |
13 | b2114bc0cc2b |
14 | 4d20c6c63bb9 |
15 | 24a4262204e1 |
hex | 1230e5063b97 |
20001210121111 has 2 divisors, whose sum is σ = 20001210121112. Its totient is φ = 20001210121110.
The previous prime is 20001210121099. The next prime is 20001210121133. The reversal of 20001210121111 is 11112101210002.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20001210121111 - 29 = 20001210120599 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20001210121091 and 20001210121100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20001210121181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000605060555 + 10000605060556.
It is an arithmetic number, because the mean of its divisors is an integer number (10000605060556).
Almost surely, 220001210121111 is an apocalyptic number.
20001210121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001210121111 is an equidigital number, since it uses as much as digits as its factorization.
20001210121111 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 13.
Adding to 20001210121111 its reverse (11112101210002), we get a palindrome (31113311331113).
The spelling of 20001210121111 in words is "twenty trillion, one billion, two hundred ten million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •