11001011111111 has 6 divisors (see below), whose sum is σ = 12797094557880. Its totient is φ = 9429438095196.

The previous prime is 11001011111099. The next prime is 11001011111119. The reversal of 11001011111111 is 11111111010011.

It is not a de Polignac number, because 11001011111111 - 2⁶ = 11001011111047 is a prime.

It is a Duffinian number.

11001011111111 is a modest number, since divided by 1111111 gives 1100101 as remainder.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11001011111119) 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 in 5 ways as a sum of consecutive naturals, for example, 112255215371 + ... + 112255215468.

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

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

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

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

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

The sum of its prime factors is 224510430853 (or 224510430846 counting only the distinct ones).

The product of its (nonzero) digits is 1, while the sum is 11.

Adding to 11001011111111 its reverse (11111111010011), we get a palindrome (22112122121122).

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