Base | Representation |
---|---|
bin | 11001011111011100011100… |
… | …001011001110001100001001 |
3 | 112200221210200022201221111112 |
4 | 121133130130023032030021 |
5 | 104143320341012444431 |
6 | 1034235313231540105 |
7 | 32420552654550014 |
oct | 3137343413161411 |
9 | 480853608657445 |
10 | 112112004031241 |
11 | 327a4485581455 |
12 | 106a808338a635 |
13 | 4a7316928b916 |
14 | 1d9836dbdc37b |
15 | ce64556e4c2b |
hex | 65f71c2ce309 |
112112004031241 has 2 divisors, whose sum is σ = 112112004031242. Its totient is φ = 112112004031240.
The previous prime is 112112004031177. The next prime is 112112004031249. The reversal of 112112004031241 is 142130400211211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72453548161225 + 39658455870016 = 8511965^2 + 6297496^2 .
It is an emirp because it is prime and its reverse (142130400211211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112112004031241 - 26 = 112112004031177 is a prime.
It is not a weakly prime, because it can be changed into another prime (112112004031249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56056002015620 + 56056002015621.
It is an arithmetic number, because the mean of its divisors is an integer number (56056002015621).
Almost surely, 2112112004031241 is an apocalyptic number.
It is an amenable number.
112112004031241 is a deficient number, since it is larger than the sum of its proper divisors (1).
112112004031241 is an equidigital number, since it uses as much as digits as its factorization.
112112004031241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 112112004031241 its reverse (142130400211211), we get a palindrome (254242404242452).
The spelling of 112112004031241 in words is "one hundred twelve trillion, one hundred twelve billion, four million, thirty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •