Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …0011100000111000010000 |
3 | 1100012010201001221102121002 |
4 | 2110233033003200320100 |
5 | 2314431004424031000 |
6 | 33423315510121132 |
7 | 2103312614005622 |
oct | 224571703407020 |
9 | 40163631842532 |
10 | 10221201002000 |
11 | 329087255487a |
12 | 1190b2b6501a8 |
13 | 591b169078a1 |
14 | 2749ccc06c12 |
15 | 12ad247ba8d5 |
hex | 94bcf0e0e10 |
10221201002000 has 80 divisors (see below), whose sum is σ = 24771164246400. Its totient is φ = 4079166883200.
The previous prime is 10221201001997. The next prime is 10221201002029. The reversal of 10221201002000 is 20010212201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
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 15 ways as a sum of consecutive naturals, for example, 4942730 + ... + 6698729.
It is an arithmetic number, because the mean of its divisors is an integer number (309639553080).
Almost surely, 210221201002000 is an apocalyptic number.
10221201002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10221201002000 is an abundant number, since it is smaller than the sum of its proper divisors (14549963244400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221201002000 is a wasteful number, since it uses less digits than its factorization.
10221201002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11641921 (or 11641905 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10221201002000 its reverse (20010212201), we get a palindrome (10241211214201).
The spelling of 10221201002000 in words is "ten trillion, two hundred twenty-one billion, two hundred one million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •