115150112000 has 576 divisors, whose sum is σ = 378810432000. Its totient is φ = 33767424000.

The previous prime is 115150111991. The next prime is 115150112003. The reversal of 115150112000 is 211051511.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 115150112000.

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 41886626 + ... + 41889374.

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

Almost surely, 2^115150112000 is an apocalyptic number.

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

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

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

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

115150112000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 50, while the sum is 17.

Adding to 115150112000 its reverse (211051511), we get a palindrome (115361163511).

The spelling of 115150112000 in words is "one hundred fifteen billion, one hundred fifty million, one hundred twelve thousand".