11011015011011 has 2 divisors, whose sum is σ = 11011015011012. Its totient is φ = 11011015011010.

The previous prime is 11011015010999. The next prime is 11011015011019. The reversal of 11011015011011 is 11011051011011.

It is a strong prime.

It is a cyclic number.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 5, while the sum is 14.

Adding to 11011015011011 its reverse (11011051011011), we get a palindrome (22022066022022).

Subtracting 11011015011011 from its reverse (11011051011011), we obtain a square (36000000 = 6000²).

The spelling of 11011015011011 in words is "eleven trillion, eleven billion, fifteen million, eleven thousand, eleven".