Base | Representation |
---|---|
bin | 11101001000100001110… |
… | …000110011000101001000 |
3 | 21002101120022002110101202 |
4 | 131020201300303011020 |
5 | 230300114411401300 |
6 | 4131414342203332 |
7 | 264432644265020 |
oct | 35104160630510 |
9 | 7071508073352 |
10 | 2002021200200 |
11 | 70206385847a |
12 | 284008a23548 |
13 | 116a36222218 |
14 | 6cc810a6a80 |
15 | 3712567bad5 |
hex | 1d221c33148 |
2002021200200 has 192 divisors, whose sum is σ = 5517504000000. Its totient is φ = 661002531840.
The previous prime is 2002021200191. The next prime is 2002021200217. The reversal of 2002021200200 is 20021202002.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15485426 + ... + 15614174.
It is an arithmetic number, because the mean of its divisors is an integer number (28737000000).
Almost surely, 22002021200200 is an apocalyptic number.
2002021200200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2002021200200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2758752000000).
2002021200200 is an abundant number, since it is smaller than the sum of its proper divisors (3515482799800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002021200200 is a wasteful number, since it uses less digits than its factorization.
2002021200200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129184 (or 129175 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 2002021200200 its reverse (20021202002), we get a palindrome (2022042402202).
The spelling of 2002021200200 in words is "two trillion, two billion, twenty-one million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •