Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …1000101011010011010001 |
3 | 1100010010001000020221210202 |
4 | 2110123200220223103101 |
5 | 2314104120401321314 |
6 | 33405454111504545 |
7 | 2101633013664254 |
oct | 224334050532321 |
9 | 40103030227722 |
10 | 10200021120209 |
11 | 3282894010138 |
12 | 11889ba528155 |
13 | 58cb1c96095b |
14 | 27397dd4b09b |
15 | 12a4d518a0de |
hex | 946e0a2b4d1 |
10200021120209 has 2 divisors, whose sum is σ = 10200021120210. Its totient is φ = 10200021120208.
The previous prime is 10200021120139. The next prime is 10200021120271. The reversal of 10200021120209 is 90202112000201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7671221471809 + 2528799648400 = 2769697^2 + 1590220^2 .
It is an emirp because it is prime and its reverse (90202112000201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10200021120209 is a prime.
It is not a weakly prime, because it can be changed into another prime (10200021120109) 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, 5100010560104 + 5100010560105.
It is an arithmetic number, because the mean of its divisors is an integer number (5100010560105).
Almost surely, 210200021120209 is an apocalyptic number.
It is an amenable number.
10200021120209 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200021120209 is an equidigital number, since it uses as much as digits as its factorization.
10200021120209 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 10200021120209 in words is "ten trillion, two hundred billion, twenty-one million, one hundred twenty thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •