Base | Representation |
---|---|
bin | 10010101010100000… |
… | …11100101111110111 |
3 | 221212022222111012212 |
4 | 21111100130233313 |
5 | 131010144410012 |
6 | 4334150004035 |
7 | 503212141541 |
oct | 112520345767 |
9 | 27768874185 |
10 | 10020310007 |
11 | 4282227244 |
12 | 1b3794661b |
13 | c38c7ba26 |
14 | 6b0b2c691 |
15 | 3d9a70b22 |
hex | 25541cbf7 |
10020310007 has 2 divisors, whose sum is σ = 10020310008. Its totient is φ = 10020310006.
The previous prime is 10020309977. The next prime is 10020310037. The reversal of 10020310007 is 70001302001.
It is a balanced prime because it is at equal distance from previous prime (10020309977) and next prime (10020310037).
It is a cyclic number.
It is not a de Polignac number, because 10020310007 - 28 = 10020309751 is a prime.
It is a super-4 number, since 4×100203100074 (a number of 41 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 10020309973 and 10020310000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10020310037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010155003 + 5010155004.
It is an arithmetic number, because the mean of its divisors is an integer number (5010155004).
Almost surely, 210020310007 is an apocalyptic number.
10020310007 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020310007 is an equidigital number, since it uses as much as digits as its factorization.
10020310007 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.
Adding to 10020310007 its reverse (70001302001), we get a palindrome (80021612008).
The spelling of 10020310007 in words is "ten billion, twenty million, three hundred ten thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •