Search a number
-
+
115347637702313 is a prime number
BaseRepresentation
bin11010001110100001110110…
…111110001000111010101001
3120010102010102012022221200022
4122032201312332020322221
5110104323430222433223
61045153550114450225
733203406664142012
oct3216416676107251
9503363365287608
10115347637702313
1133831727415865
1210b2b18a593975
134c4930a6b9153
14206abd9512009
15d506cb8acac8
hex68e876f88ea9

115347637702313 has 2 divisors, whose sum is σ = 115347637702314. Its totient is φ = 115347637702312.

The previous prime is 115347637702277. The next prime is 115347637702331. The reversal of 115347637702313 is 313207736743511.

Together with next prime (115347637702331) 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., 111631332818329 + 3716304883984 = 10565573^2 + 1927772^2 .

It is a cyclic number.

It is not a de Polignac number, because 115347637702313 - 226 = 115347570593449 is a prime.

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

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

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

Almost surely, 2115347637702313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6667920, while the sum is 53.

The spelling of 115347637702313 in words is "one hundred fifteen trillion, three hundred forty-seven billion, six hundred thirty-seven million, seven hundred two thousand, three hundred thirteen".