Search a number
-
+
53166989 is a prime number
BaseRepresentation
bin1100101011010…
…0001110001101
310201001011101202
43022310032031
5102102320424
65135315245
71213624541
oct312641615
9121034352
1053166989
1128014167
121597bb25
13b026a75
1470bda21
154a032ae
hex32b438d

53166989 has 2 divisors, whose sum is σ = 53166990. Its totient is φ = 53166988.

The previous prime is 53166983. The next prime is 53167013. The reversal of 53166989 is 98966135.

53166989 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., 29789764 + 23377225 = 5458^2 + 4835^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 253166989 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 53166989 is about 7291.5697212603. The cubic root of 53166989 is about 376.0226639613.

The spelling of 53166989 in words is "fifty-three million, one hundred sixty-six thousand, nine hundred eighty-nine".