11099011111 has 2 divisors, whose sum is σ = 11099011112. Its totient is φ = 11099011110.

The previous prime is 11099011097. The next prime is 11099011117. The reversal of 11099011111 is 11111099011.

11099011111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

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

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 2^11099011111 is an apocalyptic number.

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

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

11099011111 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 81, while the sum is 25.

The spelling of 11099011111 in words is "eleven billion, ninety-nine million, eleven thousand, one hundred eleven".