Base | Representation |
---|---|
bin | 11001011101110100001111… |
… | …010111111100000000000111 |
3 | 112200120002212221101220112211 |
4 | 121131310033113330000013 |
5 | 104140002221222023421 |
6 | 1034112051143124251 |
7 | 32406512246121031 |
oct | 3135641727740007 |
9 | 480502787356484 |
10 | 112000120111111 |
11 | 32760a90a69261 |
12 | 1068a459743687 |
13 | 4a6574869b19b |
14 | 1d92b98738c51 |
15 | ce35a80189e1 |
hex | 65dd0f5fc007 |
112000120111111 has 2 divisors, whose sum is σ = 112000120111112. Its totient is φ = 112000120111110.
The previous prime is 112000120111097. The next prime is 112000120111241. The reversal of 112000120111111 is 111111021000211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112000120111111 - 229 = 111999583240199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112000120111091 and 112000120111100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112000120111511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56000060055555 + 56000060055556.
It is an arithmetic number, because the mean of its divisors is an integer number (56000060055556).
Almost surely, 2112000120111111 is an apocalyptic number.
112000120111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
112000120111111 is an equidigital number, since it uses as much as digits as its factorization.
112000120111111 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 112000120111111 its reverse (111111021000211), we get a palindrome (223111141111322).
The spelling of 112000120111111 in words is "one hundred twelve trillion, one hundred twenty million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •