Base | Representation |
---|---|
bin | 10100101101110111… |
… | …10111110101101000 |
3 | 1001201010101220212012 |
4 | 22112323313311220 |
5 | 140234241242300 |
6 | 5035351335052 |
7 | 542422146431 |
oct | 122673676550 |
9 | 31633356765 |
10 | 11122212200 |
11 | 4798220710 |
12 | 21a4981488 |
13 | 1083347468 |
14 | 777204488 |
15 | 451680435 |
hex | 296ef7d68 |
11122212200 has 48 divisors (see below), whose sum is σ = 28209980160. Its totient is φ = 4044440000.
The previous prime is 11122212197. The next prime is 11122212203. The reversal of 11122212200 is 221222111.
It is an interprime number because it is at equal distance from previous prime (11122212197) and next prime (11122212203).
It is not an unprimeable number, because it can be changed into a prime (11122212203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2525576 + ... + 2529975.
It is an arithmetic number, because the mean of its divisors is an integer number (587707920).
Almost surely, 211122212200 is an apocalyptic number.
11122212200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11122212200 is an abundant number, since it is smaller than the sum of its proper divisors (17087767960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122212200 is a wasteful number, since it uses less digits than its factorization.
11122212200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5055578 (or 5055569 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11122212200 its reverse (221222111), we get a palindrome (11343434311).
It can be divided in two parts, 11122 and 212200, that added together give a palindrome (223322).
The spelling of 11122212200 in words is "eleven billion, one hundred twenty-two million, two hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •