Base | Representation |
---|---|
bin | 110100011010111011… |
… | …0110111101110001101 |
3 | 101202120101110000012001 |
4 | 1220311312313232031 |
5 | 3321022104214112 |
6 | 123414252112301 |
7 | 11063441245543 |
oct | 1506566675615 |
9 | 352511400161 |
10 | 112572726157 |
11 | 43818407381 |
12 | 19998465691 |
13 | a800510988 |
14 | 563cb65d93 |
15 | 2ddcddbc57 |
hex | 1a35db7b8d |
112572726157 has 2 divisors, whose sum is σ = 112572726158. Its totient is φ = 112572726156.
The previous prime is 112572726131. The next prime is 112572726197. The reversal of 112572726157 is 751627275211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72742944681 + 39829781476 = 269709^2 + 199574^2 .
It is an emirp because it is prime and its reverse (751627275211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112572726157 is a prime.
It is a super-3 number, since 3×1125727261573 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112572726197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56286363078 + 56286363079.
It is an arithmetic number, because the mean of its divisors is an integer number (56286363079).
Almost surely, 2112572726157 is an apocalyptic number.
It is an amenable number.
112572726157 is a deficient number, since it is larger than the sum of its proper divisors (1).
112572726157 is an equidigital number, since it uses as much as digits as its factorization.
112572726157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 411600, while the sum is 46.
The spelling of 112572726157 in words is "one hundred twelve billion, five hundred seventy-two million, seven hundred twenty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.245 sec. • engine limits •