Search a number
-
+
53261521 is a prime number
BaseRepresentation
bin1100101100101…
…1010011010001
310201012222001221
43023023103101
5102113332041
65141325041
71214500255
oct313132321
9121188057
1053261521
1128079195
1215a06781
13b05aac1
147106265
154a212d1
hex32cb4d1

53261521 has 2 divisors, whose sum is σ = 53261522. Its totient is φ = 53261520.

The previous prime is 53261519. The next prime is 53261539. The reversal of 53261521 is 12516235.

53261521 = 51602 + 51612.

53261521 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., 26635921 + 26625600 = 5161^2 + 5160^2 .

It is a cyclic number.

It is not a de Polignac number, because 53261521 - 21 = 53261519 is a prime.

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

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

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

Almost surely, 253261521 is an apocalyptic number.

53261521 is the 5161-st centered square number.

It is an amenable number.

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

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

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

The product of its digits is 1800, while the sum is 25.

The square root of 53261521 is about 7298.0491228821. The cubic root of 53261521 is about 376.2453906861.

Adding to 53261521 its reverse (12516235), we get a palindrome (65777756).

The spelling of 53261521 in words is "fifty-three million, two hundred sixty-one thousand, five hundred twenty-one".