Search a number
-
+
53150597 is a prime number
BaseRepresentation
bin1100101011000…
…0001110000101
310201000022220122
43022300032011
5102101304342
65135111325
71213526003
oct312601605
9121008818
1053150597
1128002915
1215972545
13b01c476
1470b7a73
1549ed4d2
hex32b0385

53150597 has 2 divisors, whose sum is σ = 53150598. Its totient is φ = 53150596.

The previous prime is 53150579. The next prime is 53150609. The reversal of 53150597 is 79505135.

Together with previous prime (53150579) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50324836 + 2825761 = 7094^2 + 1681^2 .

It is a cyclic number.

It is not a de Polignac number, because 53150597 - 212 = 53146501 is a prime.

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

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (53150527) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26575298 + 26575299.

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

Almost surely, 253150597 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 53150597 is about 7290.4455968068. The cubic root of 53150597 is about 375.9840159381.

The spelling of 53150597 in words is "fifty-three million, one hundred fifty thousand, five hundred ninety-seven".