Base | Representation |
---|---|
bin | 110010000001011011000011… |
… | …110100101101100110101000 |
3 | 1001211221210201020122211000211 |
4 | 302001123003310231212220 |
5 | 212313440201123223422 |
6 | 2055522352323310504 |
7 | 64224324400201204 |
oct | 6201330364554650 |
9 | 1054853636584024 |
10 | 220000100211112 |
11 | 6410a5781a6491 |
12 | 208115b051b434 |
13 | 959abc725b520 |
14 | 3c480c12c9b04 |
15 | 1a67a92b1c577 |
hex | c816c3d2d9a8 |
220000100211112 has 16 divisors (see below), whose sum is σ = 444230971580340. Its totient is φ = 101538507789696.
The previous prime is 220000100211097. The next prime is 220000100211121. The reversal of 220000100211112 is 211112001000022.
It can be written as a sum of positive squares in 2 ways, for example, as 164030160745476 + 55969939465636 = 12807426^2 + 7481306^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 220000100211092 and 220000100211101.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1057692789373 + ... + 1057692789580.
Almost surely, 2220000100211112 is an apocalyptic number.
It is an amenable number.
220000100211112 is an abundant number, since it is smaller than the sum of its proper divisors (224230871369228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220000100211112 is a wasteful number, since it uses less digits than its factorization.
220000100211112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2115385578972 (or 2115385578968 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220000100211112 its reverse (211112001000022), we get a palindrome (431112101211134).
The spelling of 220000100211112 in words is "two hundred twenty trillion, one hundred million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •