115000510169 has 2 divisors, whose sum is σ = 115000510170. Its totient is φ = 115000510168.

The previous prime is 115000510139. The next prime is 115000510171. The reversal of 115000510169 is 961015000511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 103369966144 + 11630544025 = 321512^2 + 107845^2 .

It is a cyclic number.

It is not a de Polignac number, because 115000510169 - 2⁸ = 115000509913 is a prime.

It is a super-2 number, since 2×115000510169² (a number of 23 digits) contains 22 as substring.

It is a Sophie Germain prime.

Together with 115000510171, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

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

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 as a sum of consecutive naturals, namely, 57500255084 + 57500255085.

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

Almost surely, 2^115000510169 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 115000510169 in words is "one hundred fifteen billion, five hundred ten thousand, one hundred sixty-nine".