Base | Representation |
---|---|
bin | 11001011101111101100010… |
… | …001110100111001011011111 |
3 | 112200121001122110112101101001 |
4 | 121131331202032213023133 |
5 | 104140133141112010142 |
6 | 1034120421333131131 |
7 | 32410314461530606 |
oct | 3135754216471337 |
9 | 480531573471331 |
10 | 112010100110047 |
11 | 32765242462167 |
12 | 10690383a89aa7 |
13 | 4a666791a48b9 |
14 | 1d93463d72a3d |
15 | ce398e2755b7 |
hex | 65df623a72df |
112010100110047 has 2 divisors, whose sum is σ = 112010100110048. Its totient is φ = 112010100110046.
The previous prime is 112010100110021. The next prime is 112010100110059. The reversal of 112010100110047 is 740011001010211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112010100110047 - 243 = 103214007087839 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112010100110347) 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, 56005050055023 + 56005050055024.
It is an arithmetic number, because the mean of its divisors is an integer number (56005050055024).
Almost surely, 2112010100110047 is an apocalyptic number.
112010100110047 is a deficient number, since it is larger than the sum of its proper divisors (1).
112010100110047 is an equidigital number, since it uses as much as digits as its factorization.
112010100110047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 112010100110047 its reverse (740011001010211), we get a palindrome (852021101120258).
The spelling of 112010100110047 in words is "one hundred twelve trillion, ten billion, one hundred million, one hundred ten thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •