Base | Representation |
---|---|
bin | 11101010010000000011… |
… | …110010001000001011100 |
3 | 21010100211200111202200020 |
4 | 131102000132101001130 |
5 | 230431441212042340 |
6 | 4140220355432140 |
7 | 265243123514244 |
oct | 35220036210134 |
9 | 7110750452606 |
10 | 2012200112220 |
11 | 706407561761 |
12 | 285b898b5650 |
13 | 117998cc229c |
14 | 6d568cbcb24 |
15 | 3751e0ca9d0 |
hex | 1d48079105c |
2012200112220 has 48 divisors (see below), whose sum is σ = 5675285595168. Its totient is φ = 532670003200.
The previous prime is 2012200112201. The next prime is 2012200112261. The reversal of 2012200112220 is 222110022102.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2012200112220.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 122388381 + ... + 122404820.
It is an arithmetic number, because the mean of its divisors is an integer number (118235116566).
Almost surely, 22012200112220 is an apocalyptic number.
2012200112220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2012200112220 is an abundant number, since it is smaller than the sum of its proper divisors (3663085482948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012200112220 is a wasteful number, since it uses less digits than its factorization.
2012200112220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 244793350 (or 244793348 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2012200112220 its reverse (222110022102), we get a palindrome (2234310134322).
The spelling of 2012200112220 in words is "two trillion, twelve billion, two hundred million, one hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •