11111000010109 has 2 divisors, whose sum is σ = 11111000010110. Its totient is φ = 11111000010108.

The previous prime is 11111000010091. The next prime is 11111000010133. The reversal of 11111000010109 is 90101000011111.

Together with previous prime (11111000010091) 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., 9054099054009 + 2056900956100 = 3009003^2 + 1434190^2 .

It is a cyclic number.

It is not a de Polignac number, because 11111000010109 - 2⁷ = 11111000009981 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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