115191032 has 48 divisors (see below), whose sum is σ = 239527680. Its totient is φ = 51891840.

The previous prime is 115191001. The next prime is 115191047. The reversal of 115191032 is 230191511.

It is a junction number, because it is equal to n+sod(n) for n = 115190989 and 115191007.

It is a congruent number.

It is an unprimeable number.

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 11 ways as a sum of consecutive naturals, for example, 122468 + ... + 123404.

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

Almost surely, 2^115191032 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 115191032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119763840).

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

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

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

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

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

The product of its (nonzero) digits is 270, while the sum is 23.

The square root of 115191032 is about 10732.7085118343. The cubic root of 115191032 is about 486.5635331174.

The spelling of 115191032 in words is "one hundred fifteen million, one hundred ninety-one thousand, thirty-two".