Base | Representation |
---|---|
bin | 1100110100011000100… |
… | …0101011001011000000 |
3 | 210001102111210200101010 |
4 | 3031012020223023000 |
5 | 12102002310324300 |
6 | 245100115040520 |
7 | 21624154131660 |
oct | 3150610531300 |
9 | 701374720333 |
10 | 220220011200 |
11 | 85438500962 |
12 | 3681b2a0140 |
13 | 179c7469647 |
14 | a9316b81a0 |
15 | 5add69da50 |
hex | 334622b2c0 |
220220011200 has 336 divisors, whose sum is σ = 826472173824. Its totient is φ = 50290176000.
The previous prime is 220220011189. The next prime is 220220011237. The reversal of 220220011200 is 2110022022.
It is a tau number, because it is divible by the number of its divisors (336).
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 48751342 + ... + 48755858.
Almost surely, 2220220011200 is an apocalyptic number.
220220011200 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 220220011200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (413236086912).
220220011200 is an abundant number, since it is smaller than the sum of its proper divisors (606252162624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220220011200 is a wasteful number, since it uses less digits than its factorization.
220220011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6000 (or 5985 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 220220011200 its reverse (2110022022), we get a palindrome (222330033222).
The spelling of 220220011200 in words is "two hundred twenty billion, two hundred twenty million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •