Base | Representation |
---|---|
bin | 1001000110001000101101… |
… | …0111101010001011110011 |
3 | 1022102002101102111022201202 |
4 | 2101202023113222023303 |
5 | 2302324043124201321 |
6 | 33134223420121415 |
7 | 2051356436142302 |
oct | 221421327521363 |
9 | 38362342438652 |
10 | 10001022100211 |
11 | 320645628203a |
12 | 115632209626b |
13 | 577127b32a4c |
14 | 2680a2b90439 |
15 | 125239a3c70b |
hex | 9188b5ea2f3 |
10001022100211 has 2 divisors, whose sum is σ = 10001022100212. Its totient is φ = 10001022100210.
The previous prime is 10001022100187. The next prime is 10001022100213. The reversal of 10001022100211 is 11200122010001.
10001022100211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10001022100211 is a prime.
Together with 10001022100213, 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 = 10001022100192 and 10001022100201.
It is not a weakly prime, because it can be changed into another prime (10001022100213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000511050105 + 5000511050106.
It is an arithmetic number, because the mean of its divisors is an integer number (5000511050106).
Almost surely, 210001022100211 is an apocalyptic number.
10001022100211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001022100211 is an equidigital number, since it uses as much as digits as its factorization.
10001022100211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10001022100211 its reverse (11200122010001), we get a palindrome (21201144110212).
The spelling of 10001022100211 in words is "ten trillion, one billion, twenty-two million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •