Base | Representation |
---|---|
bin | 110100011101001110… |
… | …1111000000101101001 |
3 | 101202202202221222110112 |
4 | 1220322131320011221 |
5 | 3321201403411022 |
6 | 123430053424105 |
7 | 11065400466206 |
oct | 1507235700551 |
9 | 352682858415 |
10 | 112650060137 |
11 | 4385802755a |
12 | 199ba33b035 |
13 | a813549724 |
14 | 5649136cad |
15 | 2de4ab58e2 |
hex | 1a3a778169 |
112650060137 has 2 divisors, whose sum is σ = 112650060138. Its totient is φ = 112650060136.
The previous prime is 112650060101. The next prime is 112650060143. The reversal of 112650060137 is 731060056211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109760352601 + 2889707536 = 331301^2 + 53756^2 .
It is a cyclic number.
It is not a de Polignac number, because 112650060137 - 222 = 112645865833 is a prime.
It is not a weakly prime, because it can be changed into another prime (112650060197) 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, 56325030068 + 56325030069.
It is an arithmetic number, because the mean of its divisors is an integer number (56325030069).
Almost surely, 2112650060137 is an apocalyptic number.
It is an amenable number.
112650060137 is a deficient number, since it is larger than the sum of its proper divisors (1).
112650060137 is an equidigital number, since it uses as much as digits as its factorization.
112650060137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The spelling of 112650060137 in words is "one hundred twelve billion, six hundred fifty million, sixty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •