Base | Representation |
---|---|
bin | 11101010000001010100… |
… | …001010110110111011101 |
3 | 21010011201202212011200012 |
4 | 131100022201112313131 |
5 | 230413413112223401 |
6 | 4135252145013005 |
7 | 265143104236235 |
oct | 35201241266735 |
9 | 7104652764605 |
10 | 2010221211101 |
11 | 705591515a94 |
12 | 285717024165 |
13 | 11774202458c |
14 | 6d41c156cc5 |
15 | 374554d48bb |
hex | 1d40a856ddd |
2010221211101 has 2 divisors, whose sum is σ = 2010221211102. Its totient is φ = 2010221211100.
The previous prime is 2010221211017. The next prime is 2010221211127. The reversal of 2010221211101 is 1011121220102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1788732379225 + 221488831876 = 1337435^2 + 470626^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010221211101 - 210 = 2010221210077 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 (2010221211701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005110605550 + 1005110605551.
It is an arithmetic number, because the mean of its divisors is an integer number (1005110605551).
Almost surely, 22010221211101 is an apocalyptic number.
It is an amenable number.
2010221211101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010221211101 is an equidigital number, since it uses as much as digits as its factorization.
2010221211101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2010221211101 its reverse (1011121220102), we get a palindrome (3021342431203).
Subtracting from 2010221211101 its reverse (1011121220102), we obtain a palindrome (999099990999).
The spelling of 2010221211101 in words is "two trillion, ten billion, two hundred twenty-one million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •