115690050 has 144 divisors (see below), whose sum is σ = 374112960. Its totient is φ = 25038720.

The previous prime is 115690033. The next prime is 115690063. The reversal of 115690050 is 50096511.

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

It is an unprimeable number.

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 58884 + ... + 60816.

Almost surely, 2^115690050 is an apocalyptic number.

115690050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 27.

The square root of 115690050 is about 10755.9309220541. The cubic root of 115690050 is about 487.2651334130.

The spelling of 115690050 in words is "one hundred fifteen million, six hundred ninety thousand, fifty".