116415032 has 32 divisors (see below), whose sum is σ = 222566400. Its totient is φ = 57074784.

The previous prime is 116415011. The next prime is 116415043. The reversal of 116415032 is 230514611.

It is a super-2 number, since 2×116415032² = 27104919351122048, which contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104993 + ... + 106095.

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

Almost surely, 2^116415032 is an apocalyptic number.

It is an amenable number.

116415032 is a deficient number, since it is larger than the sum of its proper divisors (106151368).

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

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

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

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

The square root of 116415032 is about 10789.5797879250. The cubic root of 116415032 is about 488.2808447922.

Adding to 116415032 its reverse (230514611), we get a palindrome (346929643).

The spelling of 116415032 in words is "one hundred sixteen million, four hundred fifteen thousand, thirty-two".