11010101101110 has 96 divisors (see below), whose sum is σ = 29437986090240. Its totient is φ = 2852978644224.

The previous prime is 11010101101093. The next prime is 11010101101117. The reversal of 11010101101110 is 1110110101011.

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

It is a Curzon number.

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

It is a congruent number.

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

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

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

11010101101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 11010101101110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14718993045120).

11010101101110 is an abundant number, since it is smaller than the sum of its proper divisors (18427884989130).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 11010101101110 its reverse (1110110101011), we get a palindrome (12120211202121).

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