11111110000002 has 96 divisors (see below), whose sum is σ = 26217414288000. Its totient is φ = 3387462301440.

The previous prime is 11111109999991. The next prime is 11111110000009. The reversal of 11111110000002 is 20000001111111.

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

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

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

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

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

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

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

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

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

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

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

Adding to 11111110000002 its reverse (20000001111111), we get a palindrome (31111111111113).

The spelling of 11111110000002 in words is "eleven trillion, one hundred eleven billion, one hundred ten million, two", and thus it is an aban number.