Base | Representation |
---|---|
bin | 11001011101111111011001… |
… | …011100010110011010101111 |
3 | 112200121020210212001111010211 |
4 | 121131333121130112122233 |
5 | 104140201240122400421 |
6 | 1034121352022043251 |
7 | 32410415156156146 |
oct | 3135773134263257 |
9 | 480536725044124 |
10 | 112012100200111 |
11 | 32766079460461 |
12 | 10690841879527 |
13 | 4a66907680c47 |
14 | 1d935b385275d |
15 | ce3a59b549e1 |
hex | 65dfd97166af |
112012100200111 has 2 divisors, whose sum is σ = 112012100200112. Its totient is φ = 112012100200110.
The previous prime is 112012100200093. The next prime is 112012100200181. The reversal of 112012100200111 is 111002001210211.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112012100200111 - 229 = 112011563329199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112012100200091 and 112012100200100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112012100200181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56006050100055 + 56006050100056.
It is an arithmetic number, because the mean of its divisors is an integer number (56006050100056).
Almost surely, 2112012100200111 is an apocalyptic number.
112012100200111 is a deficient number, since it is larger than the sum of its proper divisors (1).
112012100200111 is an equidigital number, since it uses as much as digits as its factorization.
112012100200111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112012100200111 its reverse (111002001210211), we get a palindrome (223014101410322).
It can be divided in two parts, 112012100 and 200111, that added together give a palindrome (112212211).
The spelling of 112012100200111 in words is "one hundred twelve trillion, twelve billion, one hundred million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •