Base | Representation |
---|---|
bin | 110100010101000110… |
… | …0101100110101011101 |
3 | 101202001202101021220212 |
4 | 1220222030230311131 |
5 | 3320122020402031 |
6 | 123343023422205 |
7 | 11055544530464 |
oct | 1505214546535 |
9 | 352052337825 |
10 | 112377122141 |
11 | 43727a57169 |
12 | 19942a54965 |
13 | a79bb3555b |
14 | 5620ba99db |
15 | 2dcab5012b |
hex | 1a2a32cd5d |
112377122141 has 2 divisors, whose sum is σ = 112377122142. Its totient is φ = 112377122140.
The previous prime is 112377122119. The next prime is 112377122149. The reversal of 112377122141 is 141221773211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107692267225 + 4684854916 = 328165^2 + 68446^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112377122141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112377122098 and 112377122107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112377122149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56188561070 + 56188561071.
It is an arithmetic number, because the mean of its divisors is an integer number (56188561071).
Almost surely, 2112377122141 is an apocalyptic number.
It is an amenable number.
112377122141 is a deficient number, since it is larger than the sum of its proper divisors (1).
112377122141 is an equidigital number, since it uses as much as digits as its factorization.
112377122141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4704, while the sum is 32.
Adding to 112377122141 its reverse (141221773211), we get a palindrome (253598895352).
The spelling of 112377122141 in words is "one hundred twelve billion, three hundred seventy-seven million, one hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •