11001100101111 has 12 divisors (see below), whose sum is σ = 16479014143592. Its totient is φ = 7334066733912.

The previous prime is 11001100101097. The next prime is 11001100101119. The reversal of 11001100101111 is 11110100110011.

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

It is not a de Polignac number, because 11001100101111 - 2⁷ = 11001100100983 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22636008196 + ... + 22636008681.

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

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

11001100101111 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 11001100101111 its reverse (11110100110011), we get a palindrome (22111200211122).

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