Base | Representation |
---|---|
bin | 11001000010010011111100… |
… | …000110010000111110100001 |
3 | 112102212102011222211202022121 |
4 | 121002103330012100332201 |
5 | 103413020300320213324 |
6 | 1030103501335304241 |
7 | 32123120502453646 |
oct | 3102237406207641 |
9 | 472772158752277 |
10 | 110110011101089 |
11 | 320a243678275a |
12 | 10424083b1b081 |
13 | 4959438b8714c |
14 | 1d294d27b3dcd |
15 | cae33279e5e4 |
hex | 6424fc190fa1 |
110110011101089 has 2 divisors, whose sum is σ = 110110011101090. Its totient is φ = 110110011101088.
The previous prime is 110110011100963. The next prime is 110110011101093. The reversal of 110110011101089 is 980101110011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105108937630225 + 5001073470864 = 10252265^2 + 2236308^2 .
It is a cyclic number.
It is not a de Polignac number, because 110110011101089 - 221 = 110110009003937 is a prime.
It is not a weakly prime, because it can be changed into another prime (110110011101099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055005550544 + 55055005550545.
It is an arithmetic number, because the mean of its divisors is an integer number (55055005550545).
Almost surely, 2110110011101089 is an apocalyptic number.
It is an amenable number.
110110011101089 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110011101089 is an equidigital number, since it uses as much as digits as its factorization.
110110011101089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 25.
The spelling of 110110011101089 in words is "one hundred ten trillion, one hundred ten billion, eleven million, one hundred one thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •