11001001901111 has 2 divisors, whose sum is σ = 11001001901112. Its totient is φ = 11001001901110.

The previous prime is 11001001901093. The next prime is 11001001901117. The reversal of 11001001901111 is 11110910010011.

It is a strong prime.

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 11001001901111.

It is a congruent number.

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

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

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

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

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

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

11001001901111 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 9, while the sum is 17.

Adding to 11001001901111 its reverse (11110910010011), we get a palindrome (22111911911122).

The spelling of 11001001901111 in words is "eleven trillion, one billion, one million, nine hundred one thousand, one hundred eleven".