Base | Representation |
---|---|
bin | 1100110011111110110… |
… | …1011111100000001101 |
3 | 210001010222222102200201 |
4 | 3030333231133200031 |
5 | 12101242212102341 |
6 | 245041304453501 |
7 | 21621405006253 |
oct | 3147755374015 |
9 | 701128872621 |
10 | 220112222221 |
11 | 8539267a461 |
12 | 367ab17a291 |
13 | 179ab029798 |
14 | a92125a5d3 |
15 | 5ad3eab331 |
hex | 333fb5f80d |
220112222221 has 4 divisors (see below), whose sum is σ = 220152372192. Its totient is φ = 220072072252.
The previous prime is 220112222207. The next prime is 220112222249. The reversal of 220112222221 is 122222211022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 220112222221 - 211 = 220112220173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220112222251) 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, 20066761 + ... + 20077726.
It is an arithmetic number, because the mean of its divisors is an integer number (55038093048).
Almost surely, 2220112222221 is an apocalyptic number.
It is an amenable number.
220112222221 is a deficient number, since it is larger than the sum of its proper divisors (40149971).
220112222221 is an equidigital number, since it uses as much as digits as its factorization.
220112222221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40149970.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 220112222221 its reverse (122222211022), we get a palindrome (342334433243).
The spelling of 220112222221 in words is "two hundred twenty billion, one hundred twelve million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •