Search a number
-
+
53118677 is a prime number
BaseRepresentation
bin1100101010100…
…0011011010101
310200221201010102
43022220123111
5102044244202
65134303445
71213333643
oct312503325
9120851112
1053118677
1127a90937
1215957b85
13b00aa91
1470aa193
1549e3d02
hex32a86d5

53118677 has 2 divisors, whose sum is σ = 53118678. Its totient is φ = 53118676.

The previous prime is 53118647. The next prime is 53118679. The reversal of 53118677 is 77681135.

53118677 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., 49014001 + 4104676 = 7001^2 + 2026^2 .

It is a cyclic number.

It is not a de Polignac number, because 53118677 - 218 = 52856533 is a prime.

Together with 53118679, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 53118677.

It is a congruent number.

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

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

Almost surely, 253118677 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 35280, while the sum is 38.

The square root of 53118677 is about 7288.2561014278. The cubic root of 53118677 is about 375.9087341678.

The spelling of 53118677 in words is "fifty-three million, one hundred eighteen thousand, six hundred seventy-seven".