Search a number
-
+
51651550337 is a prime number
BaseRepresentation
bin110000000110101011…
…000001110010000001
311221022200111121202212
4300012223001302001
51321240244102322
635421155551505
73505654635212
oct600653016201
9157280447685
1051651550337
111a9a5a54292
12a015bbb595
134b41c8474a
1426ddc03409
1515248780e2
hexc06ac1c81

51651550337 has 2 divisors, whose sum is σ = 51651550338. Its totient is φ = 51651550336.

The previous prime is 51651550303. The next prime is 51651550373. The reversal of 51651550337 is 73305515615.

Together with next prime (51651550373) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 51581677456 + 69872881 = 227116^2 + 8359^2 .

It is a cyclic number.

It is not a de Polignac number, because 51651550337 - 28 = 51651550081 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 51651550294 and 51651550303.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 251651550337 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 236250, while the sum is 41.

The spelling of 51651550337 in words is "fifty-one billion, six hundred fifty-one million, five hundred fifty thousand, three hundred thirty-seven".