Base | Representation |
---|---|
bin | 11001100000101110011001… |
… | …010001010000001010011111 |
3 | 112201021012211001122112002211 |
4 | 121200232121101100022133 |
5 | 104201241101020010421 |
6 | 1034343545220101251 |
7 | 32430116435100556 |
oct | 3140563121201237 |
9 | 481235731575084 |
10 | 112200002110111 |
11 | 32828832163573 |
12 | 10701141834827 |
13 | 4a7b551413286 |
14 | 1d9c71aca0d9d |
15 | ce88a5e2e9e1 |
hex | 660b9945029f |
112200002110111 has 2 divisors, whose sum is σ = 112200002110112. Its totient is φ = 112200002110110.
The previous prime is 112200002110073. The next prime is 112200002110151. The reversal of 112200002110111 is 111011200002211.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112200002110111 - 223 = 112199993721503 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112200002110091 and 112200002110100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112200002110151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56100001055055 + 56100001055056.
It is an arithmetic number, because the mean of its divisors is an integer number (56100001055056).
Almost surely, 2112200002110111 is an apocalyptic number.
112200002110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
112200002110111 is an equidigital number, since it uses as much as digits as its factorization.
112200002110111 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 13.
Adding to 112200002110111 its reverse (111011200002211), we get a palindrome (223211202112322).
The spelling of 112200002110111 in words is "one hundred twelve trillion, two hundred billion, two million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •