Base | Representation |
---|---|
bin | 1010001101001101100111… |
… | …1111111101100011011100 |
3 | 1110201211020021120100200221 |
4 | 2203103121333331203130 |
5 | 2432330341133001340 |
6 | 35511211142331124 |
7 | 2235525253061302 |
oct | 243233177754334 |
9 | 43654207510627 |
10 | 11222112000220 |
11 | 36372a8734160 |
12 | 1312b06729aa4 |
13 | 63531884ab14 |
14 | 2ab220230272 |
15 | 146da5ed244a |
hex | a34d9ffd8dc |
11222112000220 has 48 divisors (see below), whose sum is σ = 25711886204928. Its totient is φ = 4080284221760.
The previous prime is 11222112000181. The next prime is 11222112000331. The reversal of 11222112000220 is 2200021122211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11222112000194 and 11222112000203.
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, 1161052 + ... + 4877731.
It is an arithmetic number, because the mean of its divisors is an integer number (535664295936).
Almost surely, 211222112000220 is an apocalyptic number.
11222112000220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11222112000220 is an abundant number, since it is smaller than the sum of its proper divisors (14489774204708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222112000220 is a wasteful number, since it uses less digits than its factorization.
11222112000220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6047250 (or 6047248 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11222112000220 its reverse (2200021122211), we get a palindrome (13422133122431).
The spelling of 11222112000220 in words is "eleven trillion, two hundred twenty-two billion, one hundred twelve million, two hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •