110231100000000 has 972 divisors, whose sum is σ = 454059197209072. Its totient is φ = 25194240000000.

The previous prime is 110231099999959. The next prime is 110231100000023. The reversal of 110231100000000 is 1132011.

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

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

It is a congruent number.

It is an unprimeable number.

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 107 ways as a sum of consecutive naturals, for example, 6299991252 + ... + 6300008748.

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

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

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

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

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

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

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

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

Adding to 110231100000000 its reverse (1132011), we get a palindrome (110231101132011).

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