Base | Representation |
---|---|
bin | 11001011111010101000101… |
… | …110110111001100010000011 |
3 | 112200221001022102010222002212 |
4 | 121133111011312321202003 |
5 | 104143203211013142402 |
6 | 1034231530240332335 |
7 | 32420153302442606 |
oct | 3137250566714203 |
9 | 480831272128085 |
10 | 112104113412227 |
11 | 327a10a6522612 |
12 | 106a66409140ab |
13 | 4a724ac5c51a1 |
14 | 1d97c21c8833d |
15 | ce6142b03952 |
hex | 65f545db9883 |
112104113412227 has 2 divisors, whose sum is σ = 112104113412228. Its totient is φ = 112104113412226.
The previous prime is 112104113412157. The next prime is 112104113412289. The reversal of 112104113412227 is 722214311401211.
It is a strong prime.
It is an emirp because it is prime and its reverse (722214311401211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112104113412227 - 210 = 112104113411203 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112104113412193 and 112104113412202.
It is not a weakly prime, because it can be changed into another prime (112104113412527) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56052056706113 + 56052056706114.
It is an arithmetic number, because the mean of its divisors is an integer number (56052056706114).
Almost surely, 2112104113412227 is an apocalyptic number.
112104113412227 is a deficient number, since it is larger than the sum of its proper divisors (1).
112104113412227 is an equidigital number, since it uses as much as digits as its factorization.
112104113412227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5376, while the sum is 32.
Adding to 112104113412227 its reverse (722214311401211), we get a palindrome (834318424813438).
The spelling of 112104113412227 in words is "one hundred twelve trillion, one hundred four billion, one hundred thirteen million, four hundred twelve thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •