Base | Representation |
---|---|
bin | 11101001111111101010… |
… | …101111011100110000111 |
3 | 21010011011100211011201212 |
4 | 131033331111323212013 |
5 | 230412440012041012 |
6 | 4135214210042035 |
7 | 265134451024406 |
oct | 35177525734607 |
9 | 7104140734655 |
10 | 2010000112007 |
11 | 705488731a68 |
12 | 285674b7931b |
13 | 117708290804 |
14 | 6d3daa4163d |
15 | 37440dadb22 |
hex | 1d3fd57b987 |
2010000112007 has 2 divisors, whose sum is σ = 2010000112008. Its totient is φ = 2010000112006.
The previous prime is 2010000111949. The next prime is 2010000112009. The reversal of 2010000112007 is 7002110000102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2010000112007 - 234 = 1992820242823 is a prime.
Together with 2010000112009, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2010000111982 and 2010000112000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010000112009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005000056003 + 1005000056004.
It is an arithmetic number, because the mean of its divisors is an integer number (1005000056004).
Almost surely, 22010000112007 is an apocalyptic number.
2010000112007 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010000112007 is an equidigital number, since it uses as much as digits as its factorization.
2010000112007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 14.
Adding to 2010000112007 its reverse (7002110000102), we get a palindrome (9012110112109).
The spelling of 2010000112007 in words is "two trillion, ten billion, one hundred twelve thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •