10011010111110 has 192 divisors, whose sum is σ = 27118381215744. Its totient is φ = 2560564608000.

The previous prime is 10011010111093. The next prime is 10011010111169. The reversal of 10011010111110 is 1111101011001.

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

10011010111110 is a modest number, since divided by 10111110 gives 100110 as remainder.

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

It is a congruent number.

It is an unprimeable number.

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 95 ways as a sum of consecutive naturals, for example, 50055310 + ... + 50254910.

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

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

10011010111110 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 10011010111110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13559190607872).

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

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

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

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

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

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

Adding to 10011010111110 its reverse (1111101011001), we get a palindrome (11122111122111).

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