Search a number
-
+
51654884513 is a prime number
BaseRepresentation
bin110000000110110111…
…101111110010100001
311221022220210000101212
4300012313233302201
51321242122301023
635421355235505
73506025162641
oct600667576241
9157286700355
1051654884513
111a9a7921301
12a017148b95
134b4288122b
142700430521
151524cd5e78
hexc06defca1

51654884513 has 2 divisors, whose sum is σ = 51654884514. Its totient is φ = 51654884512.

The previous prime is 51654884459. The next prime is 51654884531. The reversal of 51654884513 is 31548845615.

Together with next prime (51654884531) 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., 51061085089 + 593799424 = 225967^2 + 24368^2 .

It is a cyclic number.

It is not a de Polignac number, because 51654884513 - 226 = 51587775649 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 251654884513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2304000, while the sum is 50.

The spelling of 51654884513 in words is "fifty-one billion, six hundred fifty-four million, eight hundred eighty-four thousand, five hundred thirteen".