Base | Representation |
---|---|
bin | 110100001010101001… |
… | …1110101010000111101 |
3 | 101201011022221111011011 |
4 | 1220111103311100331 |
5 | 3313412311421031 |
6 | 123244144155221 |
7 | 11044060661521 |
oct | 1502523652075 |
9 | 351138844134 |
10 | 112026670141 |
11 | 43568153411 |
12 | 19865608b11 |
13 | a7443516c9 |
14 | 55ca421d81 |
15 | 2da9ec76b1 |
hex | 1a154f543d |
112026670141 has 2 divisors, whose sum is σ = 112026670142. Its totient is φ = 112026670140.
The previous prime is 112026670103. The next prime is 112026670163. The reversal of 112026670141 is 141076620211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64602897241 + 47423772900 = 254171^2 + 217770^2 .
It is a cyclic number.
It is not a de Polignac number, because 112026670141 - 217 = 112026539069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112026670841) 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, 56013335070 + 56013335071.
It is an arithmetic number, because the mean of its divisors is an integer number (56013335071).
Almost surely, 2112026670141 is an apocalyptic number.
It is an amenable number.
112026670141 is a deficient number, since it is larger than the sum of its proper divisors (1).
112026670141 is an equidigital number, since it uses as much as digits as its factorization.
112026670141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 31.
The spelling of 112026670141 in words is "one hundred twelve billion, twenty-six million, six hundred seventy thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •