Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …0011100101110000110010 |
3 | 1100012010201001222110000220 |
4 | 2110233033003211300302 |
5 | 2314431004430201002 |
6 | 33423315510353510 |
7 | 2103312614121135 |
oct | 224571703456062 |
9 | 40163631873026 |
10 | 10221201022002 |
11 | 3290872568903 |
12 | 1190b2b65b896 |
13 | 591b16913a19 |
14 | 2749ccc1021c |
15 | 12ad247c17bc |
hex | 94bcf0e5c32 |
10221201022002 has 8 divisors (see below), whose sum is σ = 20442402044016. Its totient is φ = 3407067007332.
The previous prime is 10221201021991. The next prime is 10221201022009. The reversal of 10221201022002 is 20022010212201.
10221201022002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
10221201022002 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (10221201022009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 851766751828 + ... + 851766751839.
It is an arithmetic number, because the mean of its divisors is an integer number (2555300255502).
Almost surely, 210221201022002 is an apocalyptic number.
10221201022002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221201022002 is a wasteful number, since it uses less digits than its factorization.
10221201022002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1703533503672.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10221201022002 its reverse (20022010212201), we get a palindrome (30243211234203).
The spelling of 10221201022002 in words is "ten trillion, two hundred twenty-one billion, two hundred one million, twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •