Base | Representation |
---|---|
bin | 1001010001101101111101… |
… | …1100000000010100011011 |
3 | 1100010002222121102211011102 |
4 | 2110123133130000110123 |
5 | 2314104100230134321 |
6 | 33405452113022015 |
7 | 2101632351103511 |
oct | 224333734002433 |
9 | 40102877384142 |
10 | 10200001021211 |
11 | 32828837324a1 |
12 | 11889b385490b |
13 | 58cb18744461 |
14 | 27397b3d84b1 |
15 | 12a4d3519c0b |
hex | 946df70051b |
10200001021211 has 2 divisors, whose sum is σ = 10200001021212. Its totient is φ = 10200001021210.
The previous prime is 10200001021121. The next prime is 10200001021213. The reversal of 10200001021211 is 11212010000201.
Together with previous prime (10200001021121) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10200001021211 - 238 = 9925123114267 is a prime.
Together with 10200001021213, 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 = 10200001021192 and 10200001021201.
It is not a weakly prime, because it can be changed into another prime (10200001021213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100000510605 + 5100000510606.
It is an arithmetic number, because the mean of its divisors is an integer number (5100000510606).
Almost surely, 210200001021211 is an apocalyptic number.
10200001021211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200001021211 is an equidigital number, since it uses as much as digits as its factorization.
10200001021211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10200001021211 its reverse (11212010000201), we get a palindrome (21412011021412).
The spelling of 10200001021211 in words is "ten trillion, two hundred billion, one million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •