Base | Representation |
---|---|
bin | 1001000111001111011010… |
… | …0010111111011101101011 |
3 | 1022110220101000221201100012 |
4 | 2101303312202333131223 |
5 | 2303131430011233001 |
6 | 33151042520402135 |
7 | 2052630641405306 |
oct | 221636642773553 |
9 | 38426330851305 |
10 | 10020000102251 |
11 | 3213504922947 |
12 | 1159b3991634b |
13 | 578b6086a859 |
14 | 268d8343db3d |
15 | 12599abce2bb |
hex | 91cf68bf76b |
10020000102251 has 2 divisors, whose sum is σ = 10020000102252. Its totient is φ = 10020000102250.
The previous prime is 10020000102191. The next prime is 10020000102253. The reversal of 10020000102251 is 15220100002001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10020000102251 is a prime.
It is a super-2 number, since 2×100200001022512 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 10020000102253, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10020000102253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010000051125 + 5010000051126.
It is an arithmetic number, because the mean of its divisors is an integer number (5010000051126).
Almost surely, 210020000102251 is an apocalyptic number.
10020000102251 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020000102251 is an equidigital number, since it uses as much as digits as its factorization.
10020000102251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 14.
Adding to 10020000102251 its reverse (15220100002001), we get a palindrome (25240100104252).
The spelling of 10020000102251 in words is "ten trillion, twenty billion, one hundred two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •