11111010000000 has 1024 divisors, whose sum is σ = 39421305331200. Its totient is φ = 2764800000000.

The previous prime is 11111009999939. The next prime is 11111010000007. The reversal of 11111010000000 is 1011111.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

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

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 127 ways as a sum of consecutive naturals, for example, 57569999904 + ... + 57570000096.

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

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

It is an amenable number.

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

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

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

11111010000000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 11111010000000 its reverse (1011111), we get a palindrome (11111011011111).

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