Base | Representation |
---|---|
bin | 1100110011111110110… |
… | …0101110101011000011 |
3 | 210001010222121021022221 |
4 | 3030333230232223003 |
5 | 12101242134202321 |
6 | 245041300311511 |
7 | 21621403214164 |
oct | 3147754565303 |
9 | 701128537287 |
10 | 220112022211 |
11 | 85392553164 |
12 | 367ab0a2597 |
13 | 179aac89733 |
14 | a92120776b |
15 | 5ad3e6be41 |
hex | 333fb2eac3 |
220112022211 has 4 divisors (see below), whose sum is σ = 220120289424. Its totient is φ = 220103755000.
The previous prime is 220112022139. The next prime is 220112022233. The reversal of 220112022211 is 112220211022.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112220211022 = 2 ⋅56110105511.
It is a cyclic number.
It is not a de Polignac number, because 220112022211 - 29 = 220112021699 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220112022311) 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, 4093540 + ... + 4146961.
It is an arithmetic number, because the mean of its divisors is an integer number (55030072356).
Almost surely, 2220112022211 is an apocalyptic number.
220112022211 is a deficient number, since it is larger than the sum of its proper divisors (8267213).
220112022211 is an equidigital number, since it uses as much as digits as its factorization.
220112022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8267212.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 220112022211 its reverse (112220211022), we get a palindrome (332332233233).
The spelling of 220112022211 in words is "two hundred twenty billion, one hundred twelve million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.270 sec. • engine limits •