Base | Representation |
---|---|
bin | 100000000010110111100… |
… | …000100001010101000000 |
3 | 21210112000021102202202011 |
4 | 200002313200201111000 |
5 | 242034401103324300 |
6 | 4403344240302304 |
7 | 315045066153430 |
oct | 40026740412500 |
9 | 7715007382664 |
10 | 2202102011200 |
11 | 7799a71a4123 |
12 | 2b6947611994 |
13 | 12c8711c6950 |
14 | 78821bc22c0 |
15 | 3c435c64eba |
hex | 200b7821540 |
2202102011200 has 168 divisors, whose sum is σ = 6668981685632. Its totient is φ = 696928942080.
The previous prime is 2202102011177. The next prime is 2202102011209. The reversal of 2202102011200 is 21102012022.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202102011209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7416564 + ... + 7707763.
Almost surely, 22202102011200 is an apocalyptic number.
2202102011200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2202102011200 is an abundant number, since it is smaller than the sum of its proper divisors (4466879674432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2202102011200 is a wasteful number, since it uses less digits than its factorization.
2202102011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15124369 (or 15124354 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2202102011200 its reverse (21102012022), we get a palindrome (2223204023222).
The spelling of 2202102011200 in words is "two trillion, two hundred two billion, one hundred two million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •