115927000 has 64 divisors (see below), whose sum is σ = 310040640. Its totient is φ = 39744000.

The previous prime is 115926991. The next prime is 115927001. The reversal of 115927000 is 729511.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1281 + ... + 15280.

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

Almost surely, 2^115927000 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 115927000 is about 10766.9401410057. The cubic root of 115927000 is about 487.5975697761.

The spelling of 115927000 in words is "one hundred fifteen million, nine hundred twenty-seven thousand".