110010010152 has 192 divisors, whose sum is σ = 326282281920. Its totient is φ = 30813253632.

The previous prime is 110010010151. The next prime is 110010010177. The reversal of 110010010152 is 251010010011.

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

It is not an unprimeable number, because it can be changed into a prime (110010010151) 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 47 ways as a sum of consecutive naturals, for example, 12201198 + ... + 12210210.

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

Almost surely, 2^110010010152 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 10, while the sum is 12.

Adding to 110010010152 its reverse (251010010011), we get a palindrome (361020020163).

The spelling of 110010010152 in words is "one hundred ten billion, ten million, ten thousand, one hundred fifty-two".