Base | Representation |
---|---|
bin | 1010000110000110101110… |
… | …01111101100001010001000 |
3 | 2220121022002022201211020010 |
4 | 11003003113033230022020 |
5 | 10402211101030401300 |
6 | 115114312404231520 |
7 | 4450616515126356 |
oct | 503032717541210 |
9 | 86538068654203 |
10 | 22200002200200 |
11 | 7089a71542070 |
12 | 25a661399b5a0 |
13 | c505b3457866 |
14 | 56a6b32027d6 |
15 | 2877165bea50 |
hex | 1430d73ec288 |
22200002200200 has 192 divisors, whose sum is σ = 75398592484800. Its totient is φ = 5358720409600.
The previous prime is 22200002200169. The next prime is 22200002200219. The reversal of 22200002200200 is 200220000222.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
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, 5680305 + ... + 8755904.
It is an arithmetic number, because the mean of its divisors is an integer number (392701002525).
Almost surely, 222200002200200 is an apocalyptic number.
22200002200200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22200002200200 is an abundant number, since it is smaller than the sum of its proper divisors (53198590284600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22200002200200 is a wasteful number, since it uses less digits than its factorization.
22200002200200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14436472 (or 14436463 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 12.
Adding to 22200002200200 its reverse (200220000222), we get a palindrome (22400222200422).
The spelling of 22200002200200 in words is "twenty-two trillion, two hundred billion, two million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •