Base | Representation |
---|---|
bin | 11101000101100100101… |
… | …00000000000000001101 |
3 | 10112112200120120121001012 |
4 | 32202302110000000031 |
5 | 112333310021000023 |
6 | 2043043512455005 |
7 | 132130441555535 |
oct | 16426224000015 |
9 | 3475616517035 |
10 | 999424000013 |
11 | 35594287a64a |
12 | 1418410aa465 |
13 | 73325b53c4a |
14 | 3652db4a4c5 |
15 | 1aee5dd9978 |
hex | e8b250000d |
999424000013 has 2 divisors, whose sum is σ = 999424000014. Its totient is φ = 999424000012.
The previous prime is 999423999989. The next prime is 999424000031. The reversal of 999424000013 is 310000424999.
Together with next prime (999424000031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 989989180324 + 9434819689 = 994982^2 + 97133^2 .
It is a cyclic number.
It is not a de Polignac number, because 999424000013 - 228 = 999155564557 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (999424000033) 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, 499712000006 + 499712000007.
It is an arithmetic number, because the mean of its divisors is an integer number (499712000007).
Almost surely, 2999424000013 is an apocalyptic number.
It is an amenable number.
999424000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
999424000013 is an equidigital number, since it uses as much as digits as its factorization.
999424000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 41.
The spelling of 999424000013 in words is "nine hundred ninety-nine billion, four hundred twenty-four million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •