100011110100000 has 432 divisors, whose sum is σ = 360683438407488. Its totient is φ = 24245108800000.

The previous prime is 100011110099909. The next prime is 100011110100061. The reversal of 100011110100000 is 1011110001.

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 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 71 ways as a sum of consecutive naturals, for example, 34922437 + ... + 37677563.

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

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

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

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

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

100011110100000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 100011110100000 its reverse (1011110001), we get a palindrome (100012121210001).

It can be divided in two parts, 1000111 and 10100000, that added together give a palindrome (11100111).

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