Search a number
-
+
51151119073 is a prime number
BaseRepresentation
bin101111101000110110…
…000010001011100001
311220000210212002010121
4233220312002023201
51314224141302243
635255402000241
73460400224015
oct575066021341
9156023762117
1051151119073
111a76952292a
129ab64a6081
134a923ab282
142693578545
1514e59771ed
hexbe8d822e1

51151119073 has 2 divisors, whose sum is σ = 51151119074. Its totient is φ = 51151119072.

The previous prime is 51151119043. The next prime is 51151119079. The reversal of 51151119073 is 37091115115.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 41611104144 + 9540014929 = 203988^2 + 97673^2 .

It is a cyclic number.

It is not a de Polignac number, because 51151119073 - 29 = 51151118561 is a prime.

It is a super-3 number, since 3×511511190733 (a number of 33 digits) contains 333 as substring.

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

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

Almost surely, 251151119073 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4725, while the sum is 34.

The spelling of 51151119073 in words is "fifty-one billion, one hundred fifty-one million, one hundred nineteen thousand, seventy-three".