11010101001111 has 12 divisors (see below), whose sum is σ = 15904111368600. Its totient is φ = 7339775574960.

The previous prime is 11010101001049. The next prime is 11010101001209. The reversal of 11010101001111 is 11110010101011.

It is not a de Polignac number, because 11010101001111 - 2¹¹ = 11010100999063 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 = 11010101001093 and 11010101001102.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11010101201111) 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, 24074136 + ... + 24527213.

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

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

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

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

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

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

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

Adding to 11010101001111 its reverse (11110010101011), we get a palindrome (22120111102122).

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