Base | Representation |
---|---|
bin | 11101010000000100100… |
… | …011111011011101110111 |
3 | 21010011110210201012102102 |
4 | 131100010203323131313 |
5 | 230413212013101012 |
6 | 4135234213532315 |
7 | 265140451320653 |
oct | 35200443733567 |
9 | 7104423635372 |
10 | 2010121222007 |
11 | 705540031778 |
12 | 2856a964409b |
13 | 1177273b5a32 |
14 | 6d40cb69a63 |
15 | 3744b8332c2 |
hex | 1d4048fb777 |
2010121222007 has 2 divisors, whose sum is σ = 2010121222008. Its totient is φ = 2010121222006.
The previous prime is 2010121221989. The next prime is 2010121222051. The reversal of 2010121222007 is 7002221210102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2010121222007 - 26 = 2010121221943 is a prime.
It is a super-2 number, since 2×20101212220072 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2010121222007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010121422007) 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, 1005060611003 + 1005060611004.
It is an arithmetic number, because the mean of its divisors is an integer number (1005060611004).
Almost surely, 22010121222007 is an apocalyptic number.
2010121222007 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010121222007 is an equidigital number, since it uses as much as digits as its factorization.
2010121222007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 2010121222007 its reverse (7002221210102), we get a palindrome (9012342432109).
The spelling of 2010121222007 in words is "two trillion, ten billion, one hundred twenty-one million, two hundred twenty-two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •