Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0100010101101001010001 |
3 | 1100010022122221010101112102 |
4 | 2110131202210111221101 |
5 | 2314123101430133014 |
6 | 33410454302410145 |
7 | 2102041023562214 |
oct | 224354244255121 |
9 | 40108587111472 |
10 | 10202201021009 |
11 | 3283802561948 |
12 | 1189308590955 |
13 | 5900a947599a |
14 | 273b0967577b |
15 | 12a5b17368de |
hex | 94762915a51 |
10202201021009 has 2 divisors, whose sum is σ = 10202201021010. Its totient is φ = 10202201021008.
The previous prime is 10202201020939. The next prime is 10202201021029. The reversal of 10202201021009 is 90012010220201.
It is a happy number.
It is an a-pointer prime, because the next prime (10202201021029) can be obtained adding 10202201021009 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9931700131600 + 270500889409 = 3151460^2 + 520097^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10202201021009 is a prime.
It is not a weakly prime, because it can be changed into another prime (10202201021029) 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, 5101100510504 + 5101100510505.
It is an arithmetic number, because the mean of its divisors is an integer number (5101100510505).
Almost surely, 210202201021009 is an apocalyptic number.
It is an amenable number.
10202201021009 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202201021009 is an equidigital number, since it uses as much as digits as its factorization.
10202201021009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
The spelling of 10202201021009 in words is "ten trillion, two hundred two billion, two hundred one million, twenty-one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •