111110000011009 has 2 divisors, whose sum is σ = 111110000011010. Its totient is φ = 111110000011008.

The previous prime is 111110000010937. The next prime is 111110000011019. The reversal of 111110000011009 is 900110000011111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 68182540881984 + 42927459129025 = 8257272^2 + 6551905^2 .

It is a cyclic number.

It is not a de Polignac number, because 111110000011009 - 2¹³ = 111110000002817 is a prime.

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

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

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

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

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

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

It is an amenable number.

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

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

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