11001000111109 has 2 divisors, whose sum is σ = 11001000111110. Its totient is φ = 11001000111108.

The previous prime is 11001000111091. The next prime is 11001000111119. The reversal of 11001000111109 is 90111100010011.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5972207316100 + 5028792795009 = 2443810^2 + 2242497^2 .

It is a cyclic number.

It is not a de Polignac number, because 11001000111109 - 2¹¹ = 11001000109061 is a prime.

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

It is a congruent number.

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

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

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

It is an amenable number.

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

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

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