Search a number
-
+
51065437 is a prime number
BaseRepresentation
bin1100001011001…
…1001001011101
310120002101121111
43002303021131
5101033043222
65022302021
71160022553
oct302631135
9116071544
1051065437
1126909245
1215127911
13a76c347
146ad3bd3
15473a777
hex30b325d

51065437 has 2 divisors, whose sum is σ = 51065438. Its totient is φ = 51065436.

The previous prime is 51065423. The next prime is 51065449. The reversal of 51065437 is 73456015.

51065437 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 51065316 + 121 = 7146^2 + 11^2 .

It is a cyclic number.

It is not a de Polignac number, because 51065437 - 27 = 51065309 is a prime.

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

It is a congruent number.

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

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

Almost surely, 251065437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12600, while the sum is 31.

The square root of 51065437 is about 7146.0084662698. The cubic root of 51065437 is about 371.0015160150.

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