115490737 has 2 divisors, whose sum is σ = 115490738. Its totient is φ = 115490736.

The previous prime is 115490729. The next prime is 115490743. The reversal of 115490737 is 737094511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 84621601 + 30869136 = 9199^2 + 5556^2 .

It is an emirp because it is prime and its reverse (737094511) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 115490737 - 2³ = 115490729 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (115494737) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57745368 + 57745369.

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

Almost surely, 2^115490737 is an apocalyptic number.

It is an amenable number.

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

115490737 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 26460, while the sum is 37.

The square root of 115490737 is about 10746.6616676994. The cubic root of 115490737 is about 486.9851493770.

The spelling of 115490737 in words is "one hundred fifteen million, four hundred ninety thousand, seven hundred thirty-seven".