Search a number
-
+
51115297 is a prime number
BaseRepresentation
bin1100001011111…
…1010100100001
310120011221000011
43002333110201
5101041142142
65023324521
71160321122
oct302772441
9116157004
1051115297
1126942752
1215150741
13a788c4c
146b08049
15474a417
hex30bf521

51115297 has 2 divisors, whose sum is σ = 51115298. Its totient is φ = 51115296.

The previous prime is 51115289. The next prime is 51115327. The reversal of 51115297 is 79251115.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 29062881 + 22052416 = 5391^2 + 4696^2 .

It is a cyclic number.

It is not a de Polignac number, because 51115297 - 23 = 51115289 is a prime.

It is a super-2 number, since 2×511152972 = 5225547174796418, which contains 22 as substring.

It is equal to p3063964 and since 51115297 and 3063964 have the same sum of digits, it is a Honaker prime.

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

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

Almost surely, 251115297 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3150, while the sum is 31.

The square root of 51115297 is about 7149.4962759624. The cubic root of 51115297 is about 371.1222246550.

The spelling of 51115297 in words is "fifty-one million, one hundred fifteen thousand, two hundred ninety-seven".