Search a number
-
+
115365026437 is a prime number
BaseRepresentation
bin110101101110001001…
…0101001101010000101
3102000202222122120001221
41223130102221222011
53342231421321222
6124555320520341
711222565354643
oct1533422515205
9360688576057
10115365026437
1144a20605961
121a4376200b1
13ab56b7336b
145825944193
1530031050c7
hex1adc4a9a85

115365026437 has 2 divisors, whose sum is σ = 115365026438. Its totient is φ = 115365026436.

The previous prime is 115365026389. The next prime is 115365026473. The reversal of 115365026437 is 734620563511.

Together with next prime (115365026473) 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., 111445139556 + 3919886881 = 333834^2 + 62609^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-115365026437 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2115365026437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 453600, while the sum is 43.

Adding to 115365026437 its reverse (734620563511), we get a palindrome (849985589948).

The spelling of 115365026437 in words is "one hundred fifteen billion, three hundred sixty-five million, twenty-six thousand, four hundred thirty-seven".