Base | Representation |
---|---|
bin | 110010000100010101011011… |
… | …011011011010010110101000 |
3 | 1001212122221020101200200122101 |
4 | 302010111123123122112220 |
5 | 212330230013311223422 |
6 | 2100154325254103144 |
7 | 64244640351136630 |
oct | 6204253333322650 |
9 | 1055587211620571 |
10 | 220200212211112 |
11 | 64187427204971 |
12 | 2084433964aab4 |
13 | 95b3a38833193 |
14 | 3c53a662036c0 |
15 | 1a6cda5d16c27 |
hex | c8455b6da5a8 |
220200212211112 has 32 divisors (see below), whose sum is σ = 472729792849920. Its totient is φ = 94197080468160.
The previous prime is 220200212211073. The next prime is 220200212211137. The reversal of 220200212211112 is 211112212002022.
It is a self number, because there is not a number n which added to its sum of digits gives 220200212211112.
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, 3634116328 + ... + 3634176919.
It is an arithmetic number, because the mean of its divisors is an integer number (14772806026560).
Almost surely, 2220200212211112 is an apocalyptic number.
It is an amenable number.
220200212211112 is an abundant number, since it is smaller than the sum of its proper divisors (252529580638808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220200212211112 is a wasteful number, since it uses less digits than its factorization.
220200212211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7268293801 (or 7268293797 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 220200212211112 its reverse (211112212002022), we get a palindrome (431312424213134).
The spelling of 220200212211112 in words is "two hundred twenty trillion, two hundred billion, two hundred twelve million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •