11001010101111 has 12 divisors (see below), whose sum is σ = 16114155642000. Its totient is φ = 7230710864160.

The previous prime is 11001010101061. The next prime is 11001010101127. The reversal of 11001010101111 is 11110101010011.

It is not a de Polignac number, because 11001010101111 - 2⁹ = 11001010100599 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 = 11001010101093 and 11001010101102.

It is a congruent number.

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

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

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

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

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

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

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

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

Adding to 11001010101111 its reverse (11110101010011), we get a palindrome (22111111111122).

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