110000110110109 has 2 divisors, whose sum is σ = 110000110110110. Its totient is φ = 110000110110108.

The previous prime is 110000110110053. The next prime is 110000110110131. The reversal of 110000110110109 is 901011011000011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100947292846009 + 9052817264100 = 10047253^2 + 3008790^2 .

It is a cyclic number.

It is not a de Polignac number, because 110000110110109 - 2¹⁷ = 110000109979037 is a prime.

It is a super-2 number, since 2×110000110110109² (a number of 29 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 110000110110092 and 110000110110101.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (110000110110169) 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, 55000055055054 + 55000055055055.

It is an arithmetic number, because the mean of its divisors is an integer number (55000055055055).

Almost surely, 2^{110000110110109} is an apocalyptic number.

It is an amenable number.

110000110110109 is a deficient number, since it is larger than the sum of its proper divisors (1).

110000110110109 is an equidigital number, since it uses as much as digits as its factorization.

110000110110109 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 9, while the sum is 16.

The spelling of 110000110110109 in words is "one hundred ten trillion, one hundred ten million, one hundred ten thousand, one hundred nine".