Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …1100110111110011101001 |
3 | 1100010010001002022211110002 |
4 | 2110123200230313303221 |
5 | 2314104121142020014 |
6 | 33405454151232345 |
7 | 2101633026224546 |
oct | 224334054676351 |
9 | 40103032284402 |
10 | 10200022220009 |
11 | 32828946a1466 |
12 | 11889ba9786b5 |
13 | 58cb1cc5741b |
14 | 273980155bcd |
15 | 12a4d5305dde |
hex | 946e0b37ce9 |
10200022220009 has 8 divisors (see below), whose sum is σ = 10530422318592. Its totient is φ = 9869707566720.
The previous prime is 10200022219997. The next prime is 10200022220021. The reversal of 10200022220009 is 90002222000201.
It is an interprime number because it is at equal distance from previous prime (10200022219997) and next prime (10200022220021).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10200022220009 - 24 = 10200022219993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200022220209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21118664 + ... + 21596249.
It is an arithmetic number, because the mean of its divisors is an integer number (1316302789824).
Almost surely, 210200022220009 is an apocalyptic number.
It is an amenable number.
10200022220009 is a deficient number, since it is larger than the sum of its proper divisors (330400098583).
10200022220009 is an equidigital number, since it uses as much as digits as its factorization.
10200022220009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42722647.
The product of its (nonzero) digits is 288, while the sum is 20.
The spelling of 10200022220009 in words is "ten trillion, two hundred billion, twenty-two million, two hundred twenty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •