Base | Representation |
---|---|
bin | 11001011111100101110110… |
… | …100111000011101010111011 |
3 | 112200222202202201011221021202 |
4 | 121133211312213003222323 |
5 | 104144002040432242334 |
6 | 1034244104203524415 |
7 | 32421361303302653 |
oct | 3137456647035273 |
9 | 480882681157252 |
10 | 112122111212219 |
11 | 327a87a1842089 |
12 | 106aa02422970b |
13 | 4a740ba235294 |
14 | 1d98a4c2a1363 |
15 | ce6847bc517e |
hex | 65f9769c3abb |
112122111212219 has 2 divisors, whose sum is σ = 112122111212220. Its totient is φ = 112122111212218.
The previous prime is 112122111212203. The next prime is 112122111212227. The reversal of 112122111212219 is 912212111221211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112122111212219 - 24 = 112122111212203 is a prime.
It is a super-2 number, since 2×1121221112122192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112122111212191 and 112122111212200.
It is not a weakly prime, because it can be changed into another prime (112122111212249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56061055606109 + 56061055606110.
It is an arithmetic number, because the mean of its divisors is an integer number (56061055606110).
Almost surely, 2112122111212219 is an apocalyptic number.
112122111212219 is a deficient number, since it is larger than the sum of its proper divisors (1).
112122111212219 is an equidigital number, since it uses as much as digits as its factorization.
112122111212219 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 112122111212219 in words is "one hundred twelve trillion, one hundred twenty-two billion, one hundred eleven million, two hundred twelve thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •