Base | Representation |
---|---|
bin | 110010000011000010011100… |
… | …100101010001010000001101 |
3 | 1001212100102020210001020121011 |
4 | 302003002130211101100031 |
5 | 212322300023404013401 |
6 | 2100045352022005221 |
7 | 64235334344302225 |
oct | 6203023445212015 |
9 | 1055312223036534 |
10 | 220111111001101 |
11 | 6415266396a021 |
12 | 2082b011876811 |
13 | 95a8508ca28c8 |
14 | 3c4d612829085 |
15 | 1a6a8dd828451 |
hex | c8309c95140d |
220111111001101 has 16 divisors (see below), whose sum is σ = 228215396724480. Its totient is φ = 212151228252480.
The previous prime is 220111111001069. The next prime is 220111111001123. The reversal of 220111111001101 is 101100111111022.
It is a cyclic number.
It is not a de Polignac number, because 220111111001101 - 25 = 220111111001069 is a prime.
It is a super-2 number, since 2×2201111110011012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220111111008101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 800635 + ... + 20996743.
It is an arithmetic number, because the mean of its divisors is an integer number (14263462295280).
Almost surely, 2220111111001101 is an apocalyptic number.
It is an amenable number.
220111111001101 is a deficient number, since it is larger than the sum of its proper divisors (8104285723379).
220111111001101 is a wasteful number, since it uses less digits than its factorization.
220111111001101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20199684.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 220111111001101 its reverse (101100111111022), we get a palindrome (321211222112123).
The spelling of 220111111001101 in words is "two hundred twenty trillion, one hundred eleven billion, one hundred eleven million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •