Base | Representation |
---|---|
bin | 110010000011000010010110… |
… | …100111110111110011100000 |
3 | 1001212100101222210220200022102 |
4 | 302003002112213313303200 |
5 | 212322244322310120000 |
6 | 2100045334051025532 |
7 | 64235332021416152 |
oct | 6203022647676340 |
9 | 1055311883820272 |
10 | 220111011020000 |
11 | 64152612490811 |
12 | 2082aba429b2a8 |
13 | 95a84c13678a9 |
14 | 3c4d603440ad2 |
15 | 1a6a8d4b793d5 |
hex | c830969f7ce0 |
220111011020000 has 60 divisors (see below), whose sum is σ = 541506103810056. Its totient is φ = 88044404400000.
The previous prime is 220111011019987. The next prime is 220111011020023. The reversal of 220111011020000 is 20110111022.
It is a super-2 number, since 2×2201110110200002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5502755276 + ... + 5502795275.
Almost surely, 2220111011020000 is an apocalyptic number.
220111011020000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220111011020000 is an abundant number, since it is smaller than the sum of its proper divisors (321395092790056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220111011020000 is an equidigital number, since it uses as much as digits as its factorization.
220111011020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11005550581 (or 11005550558 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 220111011020000 its reverse (20110111022), we get a palindrome (220131121131022).
The spelling of 220111011020000 in words is "two hundred twenty trillion, one hundred eleven billion, eleven million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •