11000111000009 has 2 divisors, whose sum is σ = 11000111000010. Its totient is φ = 11000111000008.

The previous prime is 11000110999961. The next prime is 11000111000023. The reversal of 11000111000009 is 90000011100011.

It is a happy number.

It is an a-pointer prime, because the next prime (11000111000023) can be obtained adding 11000111000009 to its sum of digits (14).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10859680932409 + 140430067600 = 3295403^2 + 374740^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-11000111000009 is a prime.

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

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

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

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

It is an amenable number.

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

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

11000111000009 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 14.

The spelling of 11000111000009 in words is "eleven trillion, one hundred eleven million, nine", and thus it is an aban number.