Base | Representation |
---|---|
bin | 110010000001011100110111… |
… | …000010001001000001001000 |
3 | 1001211221222200221202022100201 |
4 | 302001130313002021001020 |
5 | 212314003130434023422 |
6 | 2055523312212141544 |
7 | 64224423320445160 |
oct | 6201346702110110 |
9 | 1054858627668321 |
10 | 220002033111112 |
11 | 6411037a2828aa |
12 | 20811a4b9078b4 |
13 | 959b144841035 |
14 | 3c48225cb95a0 |
15 | 1a67b57678727 |
hex | c81737089048 |
220002033111112 has 16 divisors (see below), whose sum is σ = 471432928095360. Its totient is φ = 94286585619024.
The previous prime is 220002033111061. The next prime is 220002033111121. The reversal of 220002033111112 is 211111330200022.
It is a self number, because there is not a number n which added to its sum of digits gives 220002033111112.
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 3 ways as a sum of consecutive naturals, for example, 1964303867008 + ... + 1964303867119.
It is an arithmetic number, because the mean of its divisors is an integer number (29464558005960).
Almost surely, 2220002033111112 is an apocalyptic number.
It is an amenable number.
220002033111112 is an abundant number, since it is smaller than the sum of its proper divisors (251430894984248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220002033111112 is a wasteful number, since it uses less digits than its factorization.
220002033111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3928607734140 (or 3928607734136 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 220002033111112 its reverse (211111330200022), we get a palindrome (431113363311134).
The spelling of 220002033111112 in words is "two hundred twenty trillion, two billion, thirty-three million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •