Base | Representation |
---|---|
bin | 1101001000010… |
… | …11111000001101 |
3 | 21200021011012112 |
4 | 12210023320031 |
5 | 211144233013 |
6 | 14532513405 |
7 | 2505152333 |
oct | 644137015 |
9 | 250234175 |
10 | 110149133 |
11 | 571a3746 |
12 | 30a7b865 |
13 | 19a88203 |
14 | 108b3b53 |
15 | 9a0bba8 |
hex | 690be0d |
110149133 has 2 divisors, whose sum is σ = 110149134. Its totient is φ = 110149132.
The previous prime is 110149121. The next prime is 110149181. The reversal of 110149133 is 331941011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106770889 + 3378244 = 10333^2 + 1838^2 .
It is a cyclic number.
It is not a de Polignac number, because 110149133 - 28 = 110148877 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 110149099 and 110149108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110149183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55074566 + 55074567.
It is an arithmetic number, because the mean of its divisors is an integer number (55074567).
Almost surely, 2110149133 is an apocalyptic number.
It is an amenable number.
110149133 is a deficient number, since it is larger than the sum of its proper divisors (1).
110149133 is an equidigital number, since it uses as much as digits as its factorization.
110149133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
The square root of 110149133 is about 10495.1957104191. The cubic root of 110149133 is about 479.3584208997.
The spelling of 110149133 in words is "one hundred ten million, one hundred forty-nine thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •