Search a number
-
+
51050781517 is a prime number
BaseRepresentation
bin101111100010110111…
…010001101101001101
311212202211001101212211
4233202313101231031
51314023000002032
635241415230421
73455041324501
oct574267215515
9155684041784
1051050781517
111a71792082a
129a88978411
134a77679c38
1426840da301
1514dbc57747
hexbe2dd1b4d

51050781517 has 2 divisors, whose sum is σ = 51050781518. Its totient is φ = 51050781516.

The previous prime is 51050781473. The next prime is 51050781557. The reversal of 51050781517 is 71518705015.

It is an a-pointer prime, because the next prime (51050781557) can be obtained adding 51050781517 to its sum of digits (40).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 37988348836 + 13062432681 = 194906^2 + 114291^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 51050781517.

It is a congruent number.

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

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

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

Almost surely, 251050781517 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 49000, while the sum is 40.

The spelling of 51050781517 in words is "fifty-one billion, fifty million, seven hundred eighty-one thousand, five hundred seventeen".