Base | Representation |
---|---|
bin | 110010000001100100010001… |
… | …111010001111111111010000 |
3 | 1001211222202021012021101021211 |
4 | 302001210101322033333100 |
5 | 212314120440024020422 |
6 | 2055531110535025504 |
7 | 64225124621656204 |
oct | 6201442172177720 |
9 | 1054882235241254 |
10 | 220010000220112 |
11 | 64113798525803 |
12 | 208134b3b0b294 |
13 | 959bb1430930b |
14 | 3c48780060b04 |
15 | 1a67e71d28577 |
hex | c81911e8ffd0 |
220010000220112 has 40 divisors (see below), whose sum is σ = 440971473564000. Its totient is φ = 106210964533632.
The previous prime is 220010000220091. The next prime is 220010000220191. The reversal of 220010000220112 is 211022000010022.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 220010000220092 and 220010000220101.
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 7 ways as a sum of consecutive naturals, for example, 66167203 + ... + 69412669.
It is an arithmetic number, because the mean of its divisors is an integer number (11024286839100).
Almost surely, 2220010000220112 is an apocalyptic number.
It is an amenable number.
220010000220112 is an abundant number, since it is smaller than the sum of its proper divisors (220961473343888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220010000220112 is a wasteful number, since it uses less digits than its factorization.
220010000220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3391603 (or 3391597 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 220010000220112 its reverse (211022000010022), we get a palindrome (431032000230134).
The spelling of 220010000220112 in words is "two hundred twenty trillion, ten billion, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •