Base | Representation |
---|---|
bin | 100000010101011001100… |
… | …001101111111000001111 |
3 | 21212102101000012222100211 |
4 | 200111121201233320033 |
5 | 242401124012023434 |
6 | 4420434525503251 |
7 | 316351143212515 |
oct | 40253141577017 |
9 | 7772330188324 |
10 | 2222000111119 |
11 | 7873881540a8 |
12 | 2ba77b411b27 |
13 | 1316c2743c79 |
14 | 7978c7404b5 |
15 | 3cbecaa3464 |
hex | 2055986fe0f |
2222000111119 has 2 divisors, whose sum is σ = 2222000111120. Its totient is φ = 2222000111118.
The previous prime is 2222000111117. The next prime is 2222000111143. The reversal of 2222000111119 is 9111110002222.
2222000111119 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2222000111119 - 21 = 2222000111117 is a prime.
It is a super-2 number, since 2×22220001111192 (a number of 25 digits) contains 22 as substring.
Together with 2222000111117, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2222000111119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2222000111117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1111000055559 + 1111000055560.
It is an arithmetic number, because the mean of its divisors is an integer number (1111000055560).
Almost surely, 22222000111119 is an apocalyptic number.
2222000111119 is a deficient number, since it is larger than the sum of its proper divisors (1).
2222000111119 is an equidigital number, since it uses as much as digits as its factorization.
2222000111119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 2222000111119 in words is "two trillion, two hundred twenty-two billion, one hundred eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •