Base | Representation |
---|---|
bin | 110010000011000010010111… |
… | …001010100011010100010010 |
3 | 1001212100102000110000112222122 |
4 | 302003002113022203110102 |
5 | 212322244332122023442 |
6 | 2100045335013534242 |
7 | 64235332161611660 |
oct | 6203022712432422 |
9 | 1055312013015878 |
10 | 220111020111122 |
11 | 64152617630038 |
12 | 2082aba7344382 |
13 | 95a84c31cb85a |
14 | 3c4d604729c30 |
15 | 1a6a8d5872dd2 |
hex | c830972a3512 |
220111020111122 has 16 divisors (see below), whose sum is σ = 377349571559040. Its totient is φ = 94329195776928.
The previous prime is 220111020111067. The next prime is 220111020111127. The reversal of 220111020111122 is 221111020111022.
It is a super-2 number, since 2×2201110201111222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 220111020111122.
It is not an unprimeable number, because it can be changed into a prime (220111020111127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 341212622 + ... + 341857097.
It is an arithmetic number, because the mean of its divisors is an integer number (23584348222440).
Almost surely, 2220111020111122 is an apocalyptic number.
220111020111122 is a deficient number, since it is larger than the sum of its proper divisors (157238551447918).
220111020111122 is a wasteful number, since it uses less digits than its factorization.
220111020111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683092745.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 220111020111122 its reverse (221111020111022), we get a palindrome (441222040222144).
The spelling of 220111020111122 in words is "two hundred twenty trillion, one hundred eleven billion, twenty million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •