Base | Representation |
---|---|
bin | 1001000110011001100110… |
… | …01110001110111001100001 |
3 | 2121212001011210122122112211 |
4 | 10203030303032032321201 |
5 | 10110330224133013441 |
6 | 110320551122522121 |
7 | 4133520003332413 |
oct | 443146316167141 |
9 | 77761153578484 |
10 | 20011112001121 |
11 | 6415735043a3a |
12 | 22b2354b06341 |
13 | b22069494527 |
14 | 4d2785d649b3 |
15 | 24a80569aa81 |
hex | 12333338ee61 |
20011112001121 has 2 divisors, whose sum is σ = 20011112001122. Its totient is φ = 20011112001120.
The previous prime is 20011112000959. The next prime is 20011112001211. The reversal of 20011112001121 is 12110021111002.
It is a happy number.
Together with next prime (20011112001211) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10858738467600 + 9152373533521 = 3295260^2 + 3025289^2 .
It is a cyclic number.
It is not a de Polignac number, because 20011112001121 - 229 = 20010575130209 is a prime.
It is not a weakly prime, because it can be changed into another prime (20011112001821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005556000560 + 10005556000561.
It is an arithmetic number, because the mean of its divisors is an integer number (10005556000561).
Almost surely, 220011112001121 is an apocalyptic number.
It is an amenable number.
20011112001121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20011112001121 is an equidigital number, since it uses as much as digits as its factorization.
20011112001121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20011112001121 its reverse (12110021111002), we get a palindrome (32121133112123).
The spelling of 20011112001121 in words is "twenty trillion, eleven billion, one hundred twelve million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •