Base | Representation |
---|---|
bin | 11001100001010110110100… |
… | …001111001111100010011011 |
3 | 112201102100211211102012212221 |
4 | 121201112310033033202123 |
5 | 104202443442441203201 |
6 | 1034415524050244511 |
7 | 32433214123112506 |
oct | 3141266417174233 |
9 | 481370754365787 |
10 | 112243404241051 |
11 | 32845184572976 |
12 | 10709634b86737 |
13 | 4a8267a286565 |
14 | 1da087723213d |
15 | ce9a964404a1 |
hex | 6615b43cf89b |
112243404241051 has 2 divisors, whose sum is σ = 112243404241052. Its totient is φ = 112243404241050.
The previous prime is 112243404241043. The next prime is 112243404241069. The reversal of 112243404241051 is 150142404342211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112243404241051 - 23 = 112243404241043 is a prime.
It is a super-2 number, since 2×1122434042410512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112243404240998 and 112243404241016.
It is not a weakly prime, because it can be changed into another prime (112243404241651) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56121702120525 + 56121702120526.
It is an arithmetic number, because the mean of its divisors is an integer number (56121702120526).
Almost surely, 2112243404241051 is an apocalyptic number.
112243404241051 is a deficient number, since it is larger than the sum of its proper divisors (1).
112243404241051 is an equidigital number, since it uses as much as digits as its factorization.
112243404241051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30720, while the sum is 34.
Adding to 112243404241051 its reverse (150142404342211), we get a palindrome (262385808583262).
The spelling of 112243404241051 in words is "one hundred twelve trillion, two hundred forty-three billion, four hundred four million, two hundred forty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •