Base | Representation |
---|---|
bin | 1001000110011001100111… |
… | …01101001101010101110111 |
3 | 2121212001012100221012012202 |
4 | 10203030303231031111313 |
5 | 10110330233222334312 |
6 | 110320552012535115 |
7 | 4133520132342215 |
oct | 443146355152567 |
9 | 77761170835182 |
10 | 20011120121207 |
11 | 641573968a756 |
12 | 22b235778149b |
13 | b2206b078507 |
14 | 4d2787079cb5 |
15 | 24a8062519c2 |
hex | 123333b4d577 |
20011120121207 has 2 divisors, whose sum is σ = 20011120121208. Its totient is φ = 20011120121206.
The previous prime is 20011120121173. The next prime is 20011120121227. The reversal of 20011120121207 is 70212102111002.
It is a happy number.
It is an a-pointer prime, because the next prime (20011120121227) can be obtained adding 20011120121207 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20011120121207 - 216 = 20011120055671 is a prime.
It is a super-2 number, since 2×200111201212072 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20011120121227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005560060603 + 10005560060604.
It is an arithmetic number, because the mean of its divisors is an integer number (10005560060604).
Almost surely, 220011120121207 is an apocalyptic number.
20011120121207 is a deficient number, since it is larger than the sum of its proper divisors (1).
20011120121207 is an equidigital number, since it uses as much as digits as its factorization.
20011120121207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 20011120121207 its reverse (70212102111002), we get a palindrome (90223222232209).
The spelling of 20011120121207 in words is "twenty trillion, eleven billion, one hundred twenty million, one hundred twenty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.240 sec. • engine limits •