Base | Representation |
---|---|
bin | 100111010101… |
… | …100101000111 |
3 | 201101220102012 |
4 | 213111211013 |
5 | 10114441012 |
6 | 1005004435 |
7 | 153436106 |
oct | 47254507 |
9 | 21356365 |
10 | 10312007 |
11 | 5903622 |
12 | 355371b |
13 | 21a08a4 |
14 | 152603d |
15 | d8a622 |
hex | 9d5947 |
10312007 has 2 divisors, whose sum is σ = 10312008. Its totient is φ = 10312006.
The previous prime is 10311997. The next prime is 10312021. The reversal of 10312007 is 70021301.
10312007 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (10312021) can be obtained adding 10312007 to its sum of digits (14).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10312007 - 210 = 10310983 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10311982 and 10312000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10312207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156003 + 5156004.
It is an arithmetic number, because the mean of its divisors is an integer number (5156004).
Almost surely, 210312007 is an apocalyptic number.
10312007 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312007 is an equidigital number, since it uses as much as digits as its factorization.
10312007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 14.
The square root of 10312007 is about 3211.2313837530. The cubic root of 10312007 is about 217.6612236602.
Adding to 10312007 its reverse (70021301), we get a palindrome (80333308).
The spelling of 10312007 in words is "ten million, three hundred twelve thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •