110046157000 has 384 divisors, whose sum is σ = 296561865600. Its totient is φ = 37986624000.

The previous prime is 110046156947. The next prime is 110046157003. The reversal of 110046157000 is 751640011.

It is a happy number.

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

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

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

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

Almost surely, 2^110046157000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 840, while the sum is 25.

Adding to 110046157000 its reverse (751640011), we get a palindrome (110797797011).

The spelling of 110046157000 in words is "one hundred ten billion, forty-six million, one hundred fifty-seven thousand".