Search a number
-
+
115994237 is a prime number
BaseRepresentation
bin1101110100111…
…10111001111101
322002021010011212
412322132321331
5214143303422
615302054205
72605635422
oct672367175
9262233155
10115994237
115a526207
1232a1a365
131b053858
1411595d49
15a2b39e2
hex6e9ee7d

115994237 has 2 divisors, whose sum is σ = 115994238. Its totient is φ = 115994236.

The previous prime is 115994189. The next prime is 115994273. The reversal of 115994237 is 732499511.

Together with next prime (115994273) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 77193796 + 38800441 = 8786^2 + 6229^2 .

It is a cyclic number.

It is not a de Polignac number, because 115994237 - 26 = 115994173 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2115994237 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 68040, while the sum is 41.

The square root of 115994237 is about 10770.0620703875. The cubic root of 115994237 is about 487.6918194951.

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