Base | Representation |
---|---|
bin | 110010000011000010011100… |
… | …100101010101111001001111 |
3 | 1001212100102020210002012200020 |
4 | 302003002130211111321033 |
5 | 212322300023410120421 |
6 | 2100045352022233223 |
7 | 64235334344411523 |
oct | 6203023445257117 |
9 | 1055312223065606 |
10 | 220111111020111 |
11 | 64152663982333 |
12 | 2082b011885813 |
13 | 95a8508cab45c |
14 | 3c4d612831d83 |
15 | 1a6a8dd82ddc6 |
hex | c8309c955e4f |
220111111020111 has 8 divisors (see below), whose sum is σ = 297615023351424. Its totient is φ = 144673969684440.
The previous prime is 220111111020091. The next prime is 220111111020121. The reversal of 220111111020111 is 111020111111022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220111111020111 - 211 = 220111111018063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220111111020121) by changing a digit.
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, 516692748661 + ... + 516692749086.
It is an arithmetic number, because the mean of its divisors is an integer number (37201877918928).
Almost surely, 2220111111020111 is an apocalyptic number.
220111111020111 is a deficient number, since it is larger than the sum of its proper divisors (77503912331313).
220111111020111 is a wasteful number, since it uses less digits than its factorization.
220111111020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1033385497821.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 220111111020111 its reverse (111020111111022), we get a palindrome (331131222131133).
The spelling of 220111111020111 in words is "two hundred twenty trillion, one hundred eleven billion, one hundred eleven million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •