Base | Representation |
---|---|
bin | 11001100101011011110101… |
… | …000010010011011001101001 |
3 | 112202102011020122001102000111 |
4 | 121211123311002103121221 |
5 | 104222041431021223111 |
6 | 1035152354022534321 |
7 | 32462365203606265 |
oct | 3145336502233151 |
9 | 482364218042014 |
10 | 112523664242281 |
11 | 32943021a849a6 |
12 | 10753a0b5973a1 |
13 | 4aa2c22542206 |
14 | 1db026280d0a5 |
15 | d01eeaae0a21 |
hex | 6656f5093669 |
112523664242281 has 2 divisors, whose sum is σ = 112523664242282. Its totient is φ = 112523664242280.
The previous prime is 112523664242239. The next prime is 112523664242293. The reversal of 112523664242281 is 182242466325211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89792510243881 + 22731153998400 = 9475891^2 + 4767720^2 .
It is a cyclic number.
It is not a de Polignac number, because 112523664242281 - 221 = 112523662145129 is a prime.
It is a super-3 number, since 3×1125236642422813 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (112523664246281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56261832121140 + 56261832121141.
It is an arithmetic number, because the mean of its divisors is an integer number (56261832121141).
Almost surely, 2112523664242281 is an apocalyptic number.
It is an amenable number.
112523664242281 is a deficient number, since it is larger than the sum of its proper divisors (1).
112523664242281 is an equidigital number, since it uses as much as digits as its factorization.
112523664242281 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2211840, while the sum is 49.
The spelling of 112523664242281 in words is "one hundred twelve trillion, five hundred twenty-three billion, six hundred sixty-four million, two hundred forty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •