Search a number
-
+
51140767 is a prime number
BaseRepresentation
bin1100001100010…
…1100010011111
310120020012221111
43003011202133
5101043001032
65024042451
71160455306
oct303054237
9116205844
1051140767
112695a8a7
1215163427
13a797712
146b1343d
154752c47
hex30c589f

51140767 has 2 divisors, whose sum is σ = 51140768. Its totient is φ = 51140766.

The previous prime is 51140737. The next prime is 51140773. The reversal of 51140767 is 76704115.

51140767 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 is a cyclic number.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 251140767 is an apocalyptic number.

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

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

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

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

The square root of 51140767 is about 7151.2772984971. The cubic root of 51140767 is about 371.1838559998.

The spelling of 51140767 in words is "fifty-one million, one hundred forty thousand, seven hundred sixty-seven".