Search a number
-
+
51005009597 is a prime number
BaseRepresentation
bin101111100000001000…
…101010111010111101
311212122121220221121112
4233200020222322331
51313424240301342
635233102211405
73453644266613
oct574010527275
9155577827545
1051005009597
111a6a3aa86a3
129a75583b65
134a6b042169
14267bdc36b3
1514d7c15682
hexbe022aebd

51005009597 has 2 divisors, whose sum is σ = 51005009598. Its totient is φ = 51005009596.

The previous prime is 51005009581. The next prime is 51005009641. The reversal of 51005009597 is 79590050015.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 50852956036 + 152053561 = 225506^2 + 12331^2 .

It is a cyclic number.

It is not a de Polignac number, because 51005009597 - 24 = 51005009581 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (51005009197) 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, 25502504798 + 25502504799.

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

Almost surely, 251005009597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70875, while the sum is 41.

The spelling of 51005009597 in words is "fifty-one billion, five million, nine thousand, five hundred ninety-seven".