Base | Representation |
---|---|
bin | 11101001111111110100… |
… | …001110101100010001001 |
3 | 21010011012202021002211001 |
4 | 131033332201311202021 |
5 | 230413010110310441 |
6 | 4135220200335001 |
7 | 265135112120404 |
oct | 35177641654211 |
9 | 7104182232731 |
10 | 2010020010121 |
11 | 705498992792 |
12 | 28567b774461 |
13 | 11770c439746 |
14 | 6d3dd540d3b |
15 | 374429de731 |
hex | 1d3fe875889 |
2010020010121 has 2 divisors, whose sum is σ = 2010020010122. Its totient is φ = 2010020010120.
The previous prime is 2010020010107. The next prime is 2010020010137. The reversal of 2010020010121 is 1210100200102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2009416816521 + 603193600 = 1417539^2 + 24560^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010020010121 - 29 = 2010020009609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2010020010098 and 2010020010107.
It is not a weakly prime, because it can be changed into another prime (2010020010221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005010005060 + 1005010005061.
It is an arithmetic number, because the mean of its divisors is an integer number (1005010005061).
Almost surely, 22010020010121 is an apocalyptic number.
It is an amenable number.
2010020010121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010020010121 is an equidigital number, since it uses as much as digits as its factorization.
2010020010121 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 10.
Adding to 2010020010121 its reverse (1210100200102), we get a palindrome (3220120210223).
The spelling of 2010020010121 in words is "two trillion, ten billion, twenty million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •