Search a number
-
+
53015489 is a prime number
BaseRepresentation
bin1100101000111…
…1001111000001
310200202110120122
43022033033001
5102032443424
65132150025
71212424052
oct312171701
9120673518
1053015489
1127a2035a
1215908315
13aca2b17
147080729
1549c345e
hex328f3c1

53015489 has 2 divisors, whose sum is σ = 53015490. Its totient is φ = 53015488.

The previous prime is 53015471. The next prime is 53015497. The reversal of 53015489 is 98451035.

53015489 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., 50481025 + 2534464 = 7105^2 + 1592^2 .

It is a cyclic number.

It is not a de Polignac number, because 53015489 - 212 = 53011393 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

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

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

Almost surely, 253015489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21600, while the sum is 35.

The square root of 53015489 is about 7281.1736004576. The cubic root of 53015489 is about 375.6651637512.

The spelling of 53015489 in words is "fifty-three million, fifteen thousand, four hundred eighty-nine".