110926033152 has 144 divisors (see below), whose sum is σ = 330769008192. Its totient is φ = 32705372160.

The previous prime is 110926033121. The next prime is 110926033157. The reversal of 110926033152 is 251330629011.

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

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

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 15 ways as a sum of consecutive naturals, for example, 135138 + ... + 490014.

Almost surely, 2^110926033152 is an apocalyptic number.

110926033152 is a gapful number since it is divisible by the number (12) 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 110926033152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165384504096).

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

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

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

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

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

The product of its (nonzero) digits is 9720, while the sum is 33.

The spelling of 110926033152 in words is "one hundred ten billion, nine hundred twenty-six million, thirty-three thousand, one hundred fifty-two".