Base | Representation |
---|---|
bin | 110011010010110010… |
… | …0101110100111110101 |
3 | 101112022200111222101121 |
4 | 1212211210232213311 |
5 | 3301042411114224 |
6 | 122334140423541 |
7 | 10646445662245 |
oct | 1464544564765 |
9 | 345280458347 |
10 | 110152051189 |
11 | 42795a63454 |
12 | 19421847bb1 |
13 | a505b6661b |
14 | 548d483b25 |
15 | 2cea62ebe4 |
hex | 19a592e9f5 |
110152051189 has 2 divisors, whose sum is σ = 110152051190. Its totient is φ = 110152051188.
The previous prime is 110152051153. The next prime is 110152051199. The reversal of 110152051189 is 981150251011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104878822500 + 5273228689 = 323850^2 + 72617^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110152051189 is a prime.
It is a super-2 number, since 2×1101520511892 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110152051109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55076025594 + 55076025595.
It is an arithmetic number, because the mean of its divisors is an integer number (55076025595).
Almost surely, 2110152051189 is an apocalyptic number.
It is an amenable number.
110152051189 is a deficient number, since it is larger than the sum of its proper divisors (1).
110152051189 is an equidigital number, since it uses as much as digits as its factorization.
110152051189 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 34.
The spelling of 110152051189 in words is "one hundred ten billion, one hundred fifty-two million, fifty-one thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •