Search a number
-
+
51050776141 is a prime number
BaseRepresentation
bin101111100010110111…
…010000011001001101
311212202211001010111201
4233202313100121031
51314022444314031
635241415145501
73455041303021
oct574267203115
9155684033451
1051050776141
111a717917792
129a88975291
134a77677661
1426840d8381
1514dbc55d61
hexbe2dd064d

51050776141 has 2 divisors, whose sum is σ = 51050776142. Its totient is φ = 51050776140.

The previous prime is 51050776097. The next prime is 51050776151. The reversal of 51050776141 is 14167705015.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 44253433225 + 6797342916 = 210365^2 + 82446^2 .

It is a cyclic number.

It is not a de Polignac number, because 51050776141 - 27 = 51050776013 is a prime.

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

It is a congruent number.

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

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

Almost surely, 251050776141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29400, while the sum is 37.

The spelling of 51050776141 in words is "fifty-one billion, fifty million, seven hundred seventy-six thousand, one hundred forty-one".