11010000111111 has 32 divisors (see below), whose sum is σ = 16751218867200. Its totient is φ = 7143696584640.

The previous prime is 11010000111041. The next prime is 11010000111119. The reversal of 11010000111111 is 11111100001011.

It is not a de Polignac number, because 11010000111111 - 2³⁸ = 10735122204167 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 = 11010000111093 and 11010000111102.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11010000111119) 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 31 ways as a sum of consecutive naturals, for example, 24007830 + ... + 24462131.

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

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

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

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

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

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

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

Adding to 11010000111111 its reverse (11111100001011), we get a palindrome (22121100112122).

The spelling of 11010000111111 in words is "eleven trillion, ten billion, one hundred eleven thousand, one hundred eleven".