11011011101111 has 4 divisors (see below), whose sum is σ = 12584012686992. Its totient is φ = 9438009515232.

The previous prime is 11011011101107. The next prime is 11011011101113. The reversal of 11011011101111 is 11110111011011.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 11011011101111 - 2² = 11011011101107 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11011011101113) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 786500792930 + ... + 786500792943.

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

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

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

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

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

The sum of its prime factors is 1573001585880.

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

Adding to 11011011101111 its reverse (11110111011011), we get a palindrome (22121122112122).

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