51065137 has 2 divisors, whose sum is σ = 51065138. Its totient is φ = 51065136.

The previous prime is 51065111. The next prime is 51065173. The reversal of 51065137 is 73156015.

Together with next prime (51065173) 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., 43877376 + 7187761 = 6624^2 + 2681^2 .

It is a cyclic number.

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

It is a Chen prime.

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

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

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

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

Almost surely, 2^51065137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3150, while the sum is 28.

The square root of 51065137 is about 7145.9874754998. The cubic root of 51065137 is about 371.0007894918. Note that the first 3 decimals are identical.

The spelling of 51065137 in words is "fifty-one million, sixty-five thousand, one hundred thirty-seven".