Search a number
-
+
115492691957 is a prime number
BaseRepresentation
bin110101110001111100…
…1101001111111110101
3102001002212212122020112
41223203321221333311
53343012112120312
6125020121112405
711226005453426
oct1534371517765
9361085778215
10115492691957
1144a86682955
121a472328705
13ab774523a6
14583889764d
15300e421d22
hex1ae3e69ff5

115492691957 has 2 divisors, whose sum is σ = 115492691958. Its totient is φ = 115492691956.

The previous prime is 115492691939. The next prime is 115492691989. The reversal of 115492691957 is 759196294511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 115030183921 + 462508036 = 339161^2 + 21506^2 .

It is a cyclic number.

It is not a de Polignac number, because 115492691957 - 216 = 115492626421 is a prime.

It is a super-3 number, since 3×1154926919573 (a number of 34 digits) contains 333 as substring.

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

It is a congruent number.

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

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

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

Almost surely, 2115492691957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 6123600, while the sum is 59.

The spelling of 115492691957 in words is "one hundred fifteen billion, four hundred ninety-two million, six hundred ninety-one thousand, nine hundred fifty-seven".