Base | Representation |
---|---|
bin | 1100110011100110101… |
… | …1101111111110100000 |
3 | 210000212221200222222111 |
4 | 3030321223233332200 |
5 | 12101040320231422 |
6 | 245023253245104 |
7 | 21616036340404 |
oct | 3147153577640 |
9 | 700787628874 |
10 | 220011102112 |
11 | 8534059341a |
12 | 36781333794 |
13 | 179930b31b9 |
14 | a911a57104 |
15 | 5aca184a77 |
hex | 3339aeffa0 |
220011102112 has 48 divisors (see below), whose sum is σ = 474440810760. Its totient is φ = 99964469248.
The previous prime is 220011102097. The next prime is 220011102127. The reversal of 220011102112 is 211201110022.
It is an interprime number because it is at equal distance from previous prime (220011102097) and next prime (220011102127).
It can be written as a sum of positive squares in 4 ways, for example, as 214780341136 + 5230760976 = 463444^2 + 72324^2 .
It is a junction number, because it is equal to n+sod(n) for n = 220011102092 and 220011102101.
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, 6957193 + ... + 6988744.
Almost surely, 2220011102112 is an apocalyptic number.
It is an amenable number.
220011102112 is an abundant number, since it is smaller than the sum of its proper divisors (254429708648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220011102112 is a wasteful number, since it uses less digits than its factorization.
220011102112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13945993 (or 13945985 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220011102112 its reverse (211201110022), we get a palindrome (431212212134).
The spelling of 220011102112 in words is "two hundred twenty billion, eleven million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •