11110010111111 has 8 divisors (see below), whose sum is σ = 11695457576880. Its totient is φ = 10524633654528.

The previous prime is 11110010111093. The next prime is 11110010111113. The reversal of 11110010111111 is 11111101001111.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 11110010111111 - 2³⁰ = 11108936369287 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11110010111113) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17430986 + ... + 18057111.

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

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

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

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

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

The sum of its prime factors is 35504593.

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

Adding to 11110010111111 its reverse (11111101001111), we get a palindrome (22221111112222).

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