Base | Representation |
---|---|
bin | 1100110011100110101… |
… | …1110010011010101111 |
3 | 210000212221201111200211 |
4 | 3030321223302122233 |
5 | 12101040321041421 |
6 | 245023253403251 |
7 | 21616036411510 |
oct | 3147153623257 |
9 | 700787644624 |
10 | 220011112111 |
11 | 8534059a98a |
12 | 36781339527 |
13 | 179930b790b |
14 | a911a5aa07 |
15 | 5aca1879e1 |
hex | 3339af26af |
220011112111 has 4 divisors (see below), whose sum is σ = 251441270992. Its totient is φ = 188580953232.
The previous prime is 220011112093. The next prime is 220011112169. The reversal of 220011112111 is 111211110022.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-220011112111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220011112091 and 220011112100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220011112411) 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 3 ways as a sum of consecutive naturals, for example, 15715079430 + ... + 15715079443.
It is an arithmetic number, because the mean of its divisors is an integer number (62860317748).
Almost surely, 2220011112111 is an apocalyptic number.
220011112111 is a deficient number, since it is larger than the sum of its proper divisors (31430158881).
220011112111 is an equidigital number, since it uses as much as digits as its factorization.
220011112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31430158880.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 220011112111 its reverse (111211110022), we get a palindrome (331222222133).
The spelling of 220011112111 in words is "two hundred twenty billion, eleven million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •