Base | Representation |
---|---|
bin | 110010000001011101000001… |
… | …101001001100011111010111 |
3 | 1001211222000011100201011011122 |
4 | 302001131001221030133113 |
5 | 212314004012021333421 |
6 | 2055523342011354155 |
7 | 64224430611504566 |
oct | 6201350151143727 |
9 | 1054860140634148 |
10 | 220002211121111 |
11 | 64110460806401 |
12 | 20811a9b45295b |
13 | 959b1726991b3 |
14 | 3c482417b5bdd |
15 | 1a67b680dc2ab |
hex | c81741a4c7d7 |
220002211121111 has 2 divisors, whose sum is σ = 220002211121112. Its totient is φ = 220002211121110.
The previous prime is 220002211121107. The next prime is 220002211121177. The reversal of 220002211121111 is 111121112200022.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 220002211121111 - 22 = 220002211121107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220002211121111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220002211121191) 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 as a sum of consecutive naturals, namely, 110001105560555 + 110001105560556.
It is an arithmetic number, because the mean of its divisors is an integer number (110001105560556).
Almost surely, 2220002211121111 is an apocalyptic number.
220002211121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
220002211121111 is an equidigital number, since it uses as much as digits as its factorization.
220002211121111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 220002211121111 its reverse (111121112200022), we get a palindrome (331123323321133).
The spelling of 220002211121111 in words is "two hundred twenty trillion, two billion, two hundred eleven million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •