Base | Representation |
---|---|
bin | 100000000000111010111… |
… | …100001001101000111000 |
3 | 21210022121121220101120010 |
4 | 200000322330021220320 |
5 | 242021111044232300 |
6 | 4402401022301520 |
7 | 314642231215323 |
oct | 40007274115070 |
9 | 7708547811503 |
10 | 2200012102200 |
11 | 779024528600 |
12 | 2b64637278a0 |
13 | 12c5ca22cbc3 |
14 | 786a44017ba |
15 | 3c362542a50 |
hex | 2003af09a38 |
2200012102200 has 576 divisors, whose sum is σ = 7952113219680. Its totient is φ = 501031731200.
The previous prime is 2200012102193. The next prime is 2200012102259. The reversal of 2200012102200 is 22012100022.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 835552084 + ... + 835554716.
Almost surely, 22200012102200 is an apocalyptic number.
2200012102200 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 2200012102200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3976056609840).
2200012102200 is an abundant number, since it is smaller than the sum of its proper divisors (5752101117480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200012102200 is a wasteful number, since it uses less digits than its factorization.
2200012102200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3368 (or 3348 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2200012102200 its reverse (22012100022), we get a palindrome (2222024202222).
The spelling of 2200012102200 in words is "two trillion, two hundred billion, twelve million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •