Base | Representation |
---|---|
bin | 11001000010010011111011… |
… | …110001001000001100110111 |
3 | 112102212102011121102020112111 |
4 | 121002103323301020030313 |
5 | 103413020242410410434 |
6 | 1030103501020431451 |
7 | 32123120404405345 |
oct | 3102237361101467 |
9 | 472772147366474 |
10 | 110110005560119 |
11 | 320a2433638744 |
12 | 104240820a8587 |
13 | 4959437997076 |
14 | 1d294d1b70995 |
15 | cae332057964 |
hex | 6424fbc48337 |
110110005560119 has 2 divisors, whose sum is σ = 110110005560120. Its totient is φ = 110110005560118.
The previous prime is 110110005560083. The next prime is 110110005560189. The reversal of 110110005560119 is 911065500011011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110110005560119 - 213 = 110110005551927 is a prime.
It is a super-2 number, since 2×1101100055601192 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110110005560189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055002780059 + 55055002780060.
It is an arithmetic number, because the mean of its divisors is an integer number (55055002780060).
Almost surely, 2110110005560119 is an apocalyptic number.
110110005560119 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110005560119 is an equidigital number, since it uses as much as digits as its factorization.
110110005560119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 31.
The spelling of 110110005560119 in words is "one hundred ten trillion, one hundred ten billion, five million, five hundred sixty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •