Base | Representation |
---|---|
bin | 110010000011000010010111… |
… | …001010100011010100010111 |
3 | 1001212100102000110000112222211 |
4 | 302003002113022203110113 |
5 | 212322244332122024002 |
6 | 2100045335013534251 |
7 | 64235332161611665 |
oct | 6203022712432427 |
9 | 1055312013015884 |
10 | 220111020111127 |
11 | 64152617630042 |
12 | 2082aba7344387 |
13 | 95a84c31cb862 |
14 | 3c4d604729c35 |
15 | 1a6a8d5872dd7 |
hex | c830972a3517 |
220111020111127 has 2 divisors, whose sum is σ = 220111020111128. Its totient is φ = 220111020111126.
The previous prime is 220111020111067. The next prime is 220111020111133. The reversal of 220111020111127 is 721111020111022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220111020111127 - 219 = 220111019586839 is a prime.
It is a super-2 number, since 2×2201110201111272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 220111020111098 and 220111020111107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220111020112127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110055510055563 + 110055510055564.
It is an arithmetic number, because the mean of its divisors is an integer number (110055510055564).
Almost surely, 2220111020111127 is an apocalyptic number.
220111020111127 is a deficient number, since it is larger than the sum of its proper divisors (1).
220111020111127 is an equidigital number, since it uses as much as digits as its factorization.
220111020111127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 22.
Adding to 220111020111127 its reverse (721111020111022), we get a palindrome (941222040222149).
The spelling of 220111020111127 in words is "two hundred twenty trillion, one hundred eleven billion, twenty million, one hundred eleven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •