Search a number
-
+
53766569 is a prime number
BaseRepresentation
bin1100110100011…
…0100110101001
310202011121212102
43031012212221
5102231012234
65200223145
71222002563
oct315064651
9122147772
1053766569
112839368a
121600aab5
13b1a694c
1471d8333
154ac0c7e
hex33469a9

53766569 has 2 divisors, whose sum is σ = 53766570. Its totient is φ = 53766568.

The previous prime is 53766553. The next prime is 53766577. The reversal of 53766569 is 96566735.

53766569 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., 52374169 + 1392400 = 7237^2 + 1180^2 .

It is a cyclic number.

It is not a de Polignac number, because 53766569 - 24 = 53766553 is a prime.

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

It is a Chen prime.

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

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

Almost surely, 253766569 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 53766569 is about 7332.5690586588. The cubic root of 53766569 is about 377.4308900868.

The spelling of 53766569 in words is "fifty-three million, seven hundred sixty-six thousand, five hundred sixty-nine".