110145300000 has 288 divisors, whose sum is σ = 371195866944. Its totient is φ = 28575360000.

The previous prime is 110145299959. The next prime is 110145300073. The reversal of 110145300000 is 3541011.

It is a super-2 number, since 2×110145300000² (a number of 23 digits) contains 22 as substring.

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

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 47 ways as a sum of consecutive naturals, for example, 11095039 + ... + 11104961.

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

Almost surely, 2^110145300000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 60, while the sum is 15.

Adding to 110145300000 its reverse (3541011), we get a palindrome (110148841011).

The spelling of 110145300000 in words is "one hundred ten billion, one hundred forty-five million, three hundred thousand".