100110111109 has 2 divisors, whose sum is σ = 100110111110. Its totient is φ = 100110111108.

The previous prime is 100110111091. The next prime is 100110111151. The reversal of 100110111109 is 901111011001.

Together with previous prime (100110111091) 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., 61499040100 + 38611071009 = 247990^2 + 196497^2 .

It is an emirp because it is prime and its reverse (901111011001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 100110111109 - 2⁵ = 100110111077 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2^100110111109 is an apocalyptic number.

It is an amenable number.

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

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

100110111109 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 100110111109 in words is "one hundred billion, one hundred ten million, one hundred eleven thousand, one hundred nine".