11011110001110 has 64 divisors (see below), whose sum is σ = 30310152284160. Its totient is φ = 2841576772320.

The previous prime is 11011110001109. The next prime is 11011110001123. The reversal of 11011110001110 is 1110001111011.

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

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 = 11011110001092 and 11011110001101.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 657764032 + ... + 657780771.

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

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

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

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

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

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

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

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

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

Adding to 11011110001110 its reverse (1110001111011), we get a palindrome (12121111112121).

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