Search a number
-
+
51071150159 is a prime number
BaseRepresentation
bin101111100100000100…
…111110100001001111
311212211020101020101222
4233210010332201033
51314043203301114
635243423553555
73455406420341
oct574404764117
9155736336358
1051071150159
111a728373017
129a9375b8bb
134a7b95c0a3
142686abd291
1514dd92c98e
hexbe413e84f

51071150159 has 2 divisors, whose sum is σ = 51071150160. Its totient is φ = 51071150158.

The previous prime is 51071150077. The next prime is 51071150189. The reversal of 51071150159 is 95105117015.

It is a strong prime.

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 251071150159 is an apocalyptic number.

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

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

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

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

The spelling of 51071150159 in words is "fifty-one billion, seventy-one million, one hundred fifty thousand, one hundred fifty-nine".