Search a number
-
+
51060607109 is a prime number
BaseRepresentation
bin101111100011011100…
…110000100010000101
311212210111112121001122
4233203130300202011
51314033003411414
635242410003325
73455220666521
oct574334604205
9155714477048
1051060607109
111a722421956
129a90116545
134a7970a2b5
142685536d81
1514dca48b8e
hexbe3730885

51060607109 has 2 divisors, whose sum is σ = 51060607110. Its totient is φ = 51060607108.

The previous prime is 51060607069. The next prime is 51060607127. The reversal of 51060607109 is 90170606015.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 44274472225 + 6786134884 = 210415^2 + 82378^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 251060607109 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11340, while the sum is 35.

The spelling of 51060607109 in words is "fifty-one billion, sixty million, six hundred seven thousand, one hundred nine".