Base | Representation |
---|---|
bin | 11001100010101000100111… |
… | …110010001101011010111111 |
3 | 112201201202120101220110121002 |
4 | 121202220213302031122333 |
5 | 104210413340441230213 |
6 | 1034524132113200515 |
7 | 32442443616635543 |
oct | 3142504762153277 |
9 | 481652511813532 |
10 | 112331242133183 |
11 | 32879459795357 |
12 | 1072266986013b |
13 | 4a8aa38183468 |
14 | 1da4c0ad17a23 |
15 | cebed7a87658 |
hex | 662a27c8d6bf |
112331242133183 has 2 divisors, whose sum is σ = 112331242133184. Its totient is φ = 112331242133182.
The previous prime is 112331242133101. The next prime is 112331242133219. The reversal of 112331242133183 is 381331242133211.
It is a strong prime.
It is an emirp because it is prime and its reverse (381331242133211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112331242133183 - 28 = 112331242132927 is a prime.
It is a super-2 number, since 2×1123312421331832 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112331242133083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56165621066591 + 56165621066592.
It is an arithmetic number, because the mean of its divisors is an integer number (56165621066592).
Almost surely, 2112331242133183 is an apocalyptic number.
112331242133183 is a deficient number, since it is larger than the sum of its proper divisors (1).
112331242133183 is an equidigital number, since it uses as much as digits as its factorization.
112331242133183 is an evil number, because the sum of its binary digits is even.
The product of its digits is 62208, while the sum is 38.
Adding to 112331242133183 its reverse (381331242133211), we get a palindrome (493662484266394).
The spelling of 112331242133183 in words is "one hundred twelve trillion, three hundred thirty-one billion, two hundred forty-two million, one hundred thirty-three thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.920 sec. • engine limits •