Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …01000101010000011011 |
3 | 10120112222122121022001102 |
4 | 32230220231011100123 |
5 | 113021440024034321 |
6 | 2051553201542015 |
7 | 132653514141632 |
oct | 16545055052033 |
9 | 3515878538042 |
10 | 1010000221211 |
11 | 35a37a881123 |
12 | 1438b304490b |
13 | 743200328b7 |
14 | 36c54626519 |
15 | 1b414669c0b |
hex | eb28b4541b |
1010000221211 has 2 divisors, whose sum is σ = 1010000221212. Its totient is φ = 1010000221210.
The previous prime is 1010000221193. The next prime is 1010000221213. The reversal of 1010000221211 is 1121220000101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010000221211 is a prime.
Together with 1010000221213, 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 = 1010000221192 and 1010000221201.
It is not a weakly prime, because it can be changed into another prime (1010000221213) 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, 505000110605 + 505000110606.
It is an arithmetic number, because the mean of its divisors is an integer number (505000110606).
Almost surely, 21010000221211 is an apocalyptic number.
1010000221211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010000221211 is an equidigital number, since it uses as much as digits as its factorization.
1010000221211 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 1010000221211 its reverse (1121220000101), we get a palindrome (2131220221312).
The spelling of 1010000221211 in words is "one trillion, ten billion, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •