Base | Representation |
---|---|
bin | 11001011111010001010111… |
… | …001111001011000111110111 |
3 | 112200220122222102001121220211 |
4 | 121133101113033023013313 |
5 | 104143122011131133421 |
6 | 1034230025110010251 |
7 | 32416652141253442 |
oct | 3137212717130767 |
9 | 480818872047824 |
10 | 112100110021111 |
11 | 3279a431732613 |
12 | 106a5904046987 |
13 | 4a71cc20870c4 |
14 | 1d979622d0659 |
15 | ce5eab40d9e1 |
hex | 65f4573cb1f7 |
112100110021111 has 2 divisors, whose sum is σ = 112100110021112. Its totient is φ = 112100110021110.
The previous prime is 112100110021033. The next prime is 112100110021121. The reversal of 112100110021111 is 111120011001211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112100110021111 - 215 = 112100109988343 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112100110021091 and 112100110021100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112100110021121) 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, 56050055010555 + 56050055010556.
It is an arithmetic number, because the mean of its divisors is an integer number (56050055010556).
Almost surely, 2112100110021111 is an apocalyptic number.
112100110021111 is a deficient number, since it is larger than the sum of its proper divisors (1).
112100110021111 is an equidigital number, since it uses as much as digits as its factorization.
112100110021111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 112100110021111 its reverse (111120011001211), we get a palindrome (223220121022322).
The spelling of 112100110021111 in words is "one hundred twelve trillion, one hundred billion, one hundred ten million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •