Base | Representation |
---|---|
bin | 110010000001011100000110… |
… | …101000100111000011000000 |
3 | 1001211221220121100211110222112 |
4 | 302001130012220213003000 |
5 | 212314000000101041000 |
6 | 2055523055444154452 |
7 | 64224364230534626 |
oct | 6201340650470300 |
9 | 1054856540743875 |
10 | 220001221112000 |
11 | 6410aaa2996959 |
12 | 20811863998a28 |
13 | 959b0455496a3 |
14 | 3c4818a109516 |
15 | 1a67b0b231235 |
hex | c81706a270c0 |
220001221112000 has 112 divisors (see below), whose sum is σ = 550227412481760. Its totient is φ = 87129196160000.
The previous prime is 220001221111981. The next prime is 220001221112021. The reversal of 220001221112000 is 211122100022.
It is a super-2 number, since 2×2200012211120002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 135331370 + ... + 136947369.
Almost surely, 2220001221112000 is an apocalyptic number.
220001221112000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220001221112000 is an abundant number, since it is smaller than the sum of its proper divisors (330226191369760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220001221112000 is a wasteful number, since it uses less digits than its factorization.
220001221112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272278867 (or 272278847 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 220001221112000 its reverse (211122100022), we get a palindrome (220212343212022).
The spelling of 220001221112000 in words is "two hundred twenty trillion, one billion, two hundred twenty-one million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •