Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0001001111111100000001 |
3 | 1100010022122212121020200112 |
4 | 2110131202201033330001 |
5 | 2314123101223224301 |
6 | 33410454233201105 |
7 | 2102041013650235 |
oct | 224354241177401 |
9 | 40108585536615 |
10 | 10202200211201 |
11 | 3283802059489 |
12 | 1189308260195 |
13 | 5900a92511cb |
14 | 273b095045c5 |
15 | 12a5b16269bb |
hex | 9476284ff01 |
10202200211201 has 2 divisors, whose sum is σ = 10202200211202. Its totient is φ = 10202200211200.
The previous prime is 10202200211113. The next prime is 10202200211219. The reversal of 10202200211201 is 10211200220201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9426742090000 + 775458121201 = 3070300^2 + 880601^2 .
It is an emirp because it is prime and its reverse (10211200220201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10202200211201 - 234 = 10185020342017 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10202200211501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101100105600 + 5101100105601.
It is an arithmetic number, because the mean of its divisors is an integer number (5101100105601).
Almost surely, 210202200211201 is an apocalyptic number.
It is an amenable number.
10202200211201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202200211201 is an equidigital number, since it uses as much as digits as its factorization.
10202200211201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10202200211201 its reverse (10211200220201), we get a palindrome (20413400431402).
The spelling of 10202200211201 in words is "ten trillion, two hundred two billion, two hundred million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •