Base | Representation |
---|---|
bin | 11001010010010110011100… |
… | …111100001010010111010111 |
3 | 112120202210011220121210102102 |
4 | 121102112130330022113113 |
5 | 104034100112112241434 |
6 | 1032310104503232315 |
7 | 32265550342021616 |
oct | 3122263474122727 |
9 | 476683156553372 |
10 | 111212221212119 |
11 | 32487924639895 |
12 | 1058180ba4869b |
13 | 4a093627c4011 |
14 | 1d669b35cb87d |
15 | cccd422b807e |
hex | 65259cf0a5d7 |
111212221212119 has 2 divisors, whose sum is σ = 111212221212120. Its totient is φ = 111212221212118.
The previous prime is 111212221212091. The next prime is 111212221212121. The reversal of 111212221212119 is 911212122212111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111212221212119 - 216 = 111212221146583 is a prime.
It is a super-2 number, since 2×1112122212121192 (a number of 29 digits) contains 22 as substring.
Together with 111212221212121, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 111212221212091 and 111212221212100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111212221212149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55606110606059 + 55606110606060.
It is an arithmetic number, because the mean of its divisors is an integer number (55606110606060).
Almost surely, 2111212221212119 is an apocalyptic number.
111212221212119 is a deficient number, since it is larger than the sum of its proper divisors (1).
111212221212119 is an equidigital number, since it uses as much as digits as its factorization.
111212221212119 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 576, while the sum is 29.
The spelling of 111212221212119 in words is "one hundred eleven trillion, two hundred twelve billion, two hundred twenty-one million, two hundred twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.833 sec. • engine limits •