Base | Representation |
---|---|
bin | 1001000111010011001001… |
… | …0001110001100110110000 |
3 | 1022110222221212121200012110 |
4 | 2101310302101301212300 |
5 | 2303141003032101000 |
6 | 33151330155325320 |
7 | 2052664530315240 |
oct | 221646221614660 |
9 | 38428855550173 |
10 | 10021002222000 |
11 | 3213979564290 |
12 | 115a179450840 |
13 | 578c9036a813 |
14 | 26903a57db20 |
15 | 125a08b7d850 |
hex | 91d324719b0 |
10021002222000 has 320 divisors, whose sum is σ = 40279745645568. Its totient is φ = 2082286080000.
The previous prime is 10021002221987. The next prime is 10021002222013. The reversal of 10021002222000 is 22220012001.
It is an interprime number because it is at equal distance from previous prime (10021002221987) and next prime (10021002222013).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
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 in 63 ways as a sum of consecutive naturals, for example, 10383241 + ... + 11307240.
Almost surely, 210021002222000 is an apocalyptic number.
10021002222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10021002222000 is an abundant number, since it is smaller than the sum of its proper divisors (30258743423568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021002222000 is a wasteful number, since it uses less digits than its factorization.
10021002222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21690525 (or 21690509 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10021002222000 its reverse (22220012001), we get a palindrome (10043222234001).
The spelling of 10021002222000 in words is "ten trillion, twenty-one billion, two million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •