11011010011011 has 32 divisors (see below), whose sum is σ = 16518317571840. Its totient is φ = 7248202056000.

The previous prime is 11011010010971. The next prime is 11011010011087. The reversal of 11011010011011 is 11011001011011.

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

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

It is a Harshad number since it is a multiple of its sum of digits (9).

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2671956 + ... + 5400126.

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

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

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

11011010011011 is a wasteful number, since it uses less digits than its factorization.

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

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

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

Adding to 11011010011011 its reverse (11011001011011), we get a palindrome (22022011022022).

Subtracting from 11011010011011 its reverse (11011001011011), we obtain a square (9000000 = 3000²).

The spelling of 11011010011011 in words is "eleven trillion, eleven billion, ten million, eleven thousand, eleven".