Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0100101001011101101101 |
3 | 1100010022122221021111220002 |
4 | 2110131202210221131231 |
5 | 2314123101440232224 |
6 | 33410454304234045 |
7 | 2102041024350665 |
oct | 224354244513555 |
9 | 40108587244802 |
10 | 10202201102189 |
11 | 3283802607938 |
12 | 118930860b925 |
13 | 5900a94a3915 |
14 | 273b096971a5 |
15 | 12a5b17509ae |
hex | 9476292976d |
10202201102189 has 2 divisors, whose sum is σ = 10202201102190. Its totient is φ = 10202201102188.
The previous prime is 10202201102131. The next prime is 10202201102243. The reversal of 10202201102189 is 98120110220201.
10202201102189 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 can be written as a sum of positive squares in only one way, i.e., 9855568652164 + 346632450025 = 3139358^2 + 588755^2 .
It is a cyclic number.
It is not a de Polignac number, because 10202201102189 - 220 = 10202200053613 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 (10202201102789) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101100551094 + 5101100551095.
It is an arithmetic number, because the mean of its divisors is an integer number (5101100551095).
Almost surely, 210202201102189 is an apocalyptic number.
It is an amenable number.
10202201102189 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202201102189 is an equidigital number, since it uses as much as digits as its factorization.
10202201102189 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 29.
The spelling of 10202201102189 in words is "ten trillion, two hundred two billion, two hundred one million, one hundred two thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •