Base | Representation |
---|---|
bin | 11001011101110110000000… |
… | …101111100010001010000111 |
3 | 112200120021210111101002010222 |
4 | 121131312000233202022013 |
5 | 104140020120130401434 |
6 | 1034113004005534555 |
7 | 32406610343004443 |
oct | 3135660057421207 |
9 | 480507714332128 |
10 | 112002022122119 |
11 | 32761877668288 |
12 | 1068a8aa71445b |
13 | 4a6598c75719c |
14 | 1d92cd91a7823 |
15 | ce3669ec272e |
hex | 65dd80be2287 |
112002022122119 has 2 divisors, whose sum is σ = 112002022122120. Its totient is φ = 112002022122118.
The previous prime is 112002022122103. The next prime is 112002022122121. The reversal of 112002022122119 is 911221220200211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112002022122119 - 24 = 112002022122103 is a prime.
It is a super-2 number, since 2×1120020221221192 (a number of 29 digits) contains 22 as substring.
Together with 112002022122121, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112002022022119) 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, 56001011061059 + 56001011061060.
It is an arithmetic number, because the mean of its divisors is an integer number (56001011061060).
Almost surely, 2112002022122119 is an apocalyptic number.
112002022122119 is a deficient number, since it is larger than the sum of its proper divisors (1).
112002022122119 is an equidigital number, since it uses as much as digits as its factorization.
112002022122119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 112002022122119 in words is "one hundred twelve trillion, two billion, twenty-two million, one hundred twenty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •