Search a number
-
+
53279489 is a prime number
BaseRepresentation
bin1100101100111…
…1101100000001
310201020212201102
43023033230001
5102114420424
65141544145
71214603534
oct313175401
9121225642
1053279489
112809073a
1215a15055
13b066033
14710ca1b
154a267ae
hex32cfb01

53279489 has 2 divisors, whose sum is σ = 53279490. Its totient is φ = 53279488.

The previous prime is 53279461. The next prime is 53279497. The reversal of 53279489 is 98497235.

It is a happy number.

53279489 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., 44823025 + 8456464 = 6695^2 + 2908^2 .

It is a cyclic number.

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

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

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 (53279449) 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, 26639744 + 26639745.

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

Almost surely, 253279489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 544320, while the sum is 47.

The square root of 53279489 is about 7299.2800329896. The cubic root of 53279489 is about 376.2876952553.

The spelling of 53279489 in words is "fifty-three million, two hundred seventy-nine thousand, four hundred eighty-nine".