110100010110109 has 2 divisors, whose sum is σ = 110100010110110. Its totient is φ = 110100010110108.

The previous prime is 110100010110091. The next prime is 110100010110149. The reversal of 110100010110109 is 901011010001011.

Together with previous prime (110100010110091) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 97504822049209 + 12595188060900 = 9874453^2 + 3548970^2 .

It is a cyclic number.

It is not a de Polignac number, because 110100010110109 - 2⁷ = 110100010109981 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (110100010110149) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050005055054 + 55050005055055.

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

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

It is an amenable number.

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

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

110100010110109 is an evil number, because the sum of its binary digits is even.

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

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