Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …11000111000000001110101 |
3 | 2121211000000102002010122211 |
4 | 10203002220320320001311 |
5 | 10110140403002241041 |
6 | 110311544322453421 |
7 | 4132652426214562 |
oct | 443025070700165 |
9 | 77730012063584 |
10 | 20000201212021 |
11 | 64110461a8668 |
12 | 22b020ab04271 |
13 | b2101aba38c4 |
14 | 4d202cc77869 |
15 | 24a3b787e481 |
hex | 1230a8e38075 |
20000201212021 has 2 divisors, whose sum is σ = 20000201212022. Its totient is φ = 20000201212020.
The previous prime is 20000201212003. The next prime is 20000201212031. The reversal of 20000201212021 is 12021210200002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10027957223025 + 9972243988996 = 3166695^2 + 3157886^2 .
It is a cyclic number.
It is not a de Polignac number, because 20000201212021 - 229 = 19999664341109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20000201211992 and 20000201212010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20000201212031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000100606010 + 10000100606011.
It is an arithmetic number, because the mean of its divisors is an integer number (10000100606011).
Almost surely, 220000201212021 is an apocalyptic number.
It is an amenable number.
20000201212021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20000201212021 is an equidigital number, since it uses as much as digits as its factorization.
20000201212021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20000201212021 its reverse (12021210200002), we get a palindrome (32021411412023).
The spelling of 20000201212021 in words is "twenty trillion, two hundred one million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •