Base | Representation |
---|---|
bin | 110010000011000010010111… |
… | …001010100011010100000111 |
3 | 1001212100102000110000112222020 |
4 | 302003002113022203110013 |
5 | 212322244332122023421 |
6 | 2100045335013534223 |
7 | 64235332161611643 |
oct | 6203022712432407 |
9 | 1055312013015866 |
10 | 220111020111111 |
11 | 64152617630028 |
12 | 2082aba7344373 |
13 | 95a84c31cb84c |
14 | 3c4d604729c23 |
15 | 1a6a8d5872dc6 |
hex | c830972a3507 |
220111020111111 has 8 divisors (see below), whose sum is σ = 306241419285120. Its totient is φ = 140360650505592.
The previous prime is 220111020111067. The next prime is 220111020111127. The reversal of 220111020111111 is 111111020111022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220111020111111 - 210 = 220111020110087 is a prime.
It is a super-2 number, since 2×2201110201111112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220111020111011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1595007392041 + ... + 1595007392178.
It is an arithmetic number, because the mean of its divisors is an integer number (38280177410640).
Almost surely, 2220111020111111 is an apocalyptic number.
220111020111111 is a deficient number, since it is larger than the sum of its proper divisors (86130399174009).
220111020111111 is a wasteful number, since it uses less digits than its factorization.
220111020111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3190014784245.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 220111020111111 its reverse (111111020111022), we get a palindrome (331222040222133).
The spelling of 220111020111111 in words is "two hundred twenty trillion, one hundred eleven billion, twenty million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •