Base | Representation |
---|---|
bin | 11101010001110101010… |
… | …000110000000110011001 |
3 | 21010100100120120200211012 |
4 | 131101311100300012121 |
5 | 230431100034120441 |
6 | 4140150000143305 |
7 | 265235350663625 |
oct | 35216520600631 |
9 | 7110316520735 |
10 | 2012012020121 |
11 | 706320372344 |
12 | 285b36907b35 |
13 | 11796904709c |
14 | 6d54bd1a185 |
15 | 3750c8249eb |
hex | 1d475430199 |
2012012020121 has 2 divisors, whose sum is σ = 2012012020122. Its totient is φ = 2012012020120.
The previous prime is 2012012020111. The next prime is 2012012020133. The reversal of 2012012020121 is 1210202102102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1913142650896 + 98869369225 = 1383164^2 + 314435^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012012020121 is a prime.
It is a super-2 number, since 2×20120120201212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2012012020096 and 2012012020105.
It is not a weakly prime, because it can be changed into another prime (2012012020111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006006010060 + 1006006010061.
It is an arithmetic number, because the mean of its divisors is an integer number (1006006010061).
Almost surely, 22012012020121 is an apocalyptic number.
It is an amenable number.
2012012020121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012012020121 is an equidigital number, since it uses as much as digits as its factorization.
2012012020121 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 14.
Adding to 2012012020121 its reverse (1210202102102), we get a palindrome (3222214122223).
The spelling of 2012012020121 in words is "two trillion, twelve billion, twelve million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •