Base | Representation |
---|---|
bin | 11001011111011011100110… |
… | …111000110110001111011111 |
3 | 112200221201101000111120112021 |
4 | 121133123212320312033133 |
5 | 104143312023131201421 |
6 | 1034235044414121011 |
7 | 32420521550602264 |
oct | 3137334670661737 |
9 | 480851330446467 |
10 | 112111110022111 |
11 | 327a4066971132 |
12 | 106a7a73ab0167 |
13 | 4a73055cb2035 |
14 | 1d982c71a126b |
15 | ce6401e9d341 |
hex | 65f6e6e363df |
112111110022111 has 2 divisors, whose sum is σ = 112111110022112. Its totient is φ = 112111110022110.
The previous prime is 112111110022097. The next prime is 112111110022117. The reversal of 112111110022111 is 111220011111211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112111110022111 - 27 = 112111110021983 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112111110022117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56055555011055 + 56055555011056.
It is an arithmetic number, because the mean of its divisors is an integer number (56055555011056).
Almost surely, 2112111110022111 is an apocalyptic number.
112111110022111 is a deficient number, since it is larger than the sum of its proper divisors (1).
112111110022111 is an equidigital number, since it uses as much as digits as its factorization.
112111110022111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 112111110022111 its reverse (111220011111211), we get a palindrome (223331121133322).
The spelling of 112111110022111 in words is "one hundred twelve trillion, one hundred eleven billion, one hundred ten million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •