Search a number
-
+
53050709 is a prime number
BaseRepresentation
bin1100101001011…
…1110101010101
310200211020220002
43022113311111
5102040110314
65133021045
71212631535
oct312276525
9120736802
1053050709
1127a44868
1215924785
13acb5b6a
14708d4c5
1549cdade
hex3297d55

53050709 has 2 divisors, whose sum is σ = 53050710. Its totient is φ = 53050708.

The previous prime is 53050649. The next prime is 53050747. The reversal of 53050709 is 90705035.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 52200625 + 850084 = 7225^2 + 922^2 .

It is a cyclic number.

It is not a de Polignac number, because 53050709 - 28 = 53050453 is a prime.

It is equal to p3172907 and since 53050709 and 3172907 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

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

Almost surely, 253050709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4725, while the sum is 29.

The square root of 53050709 is about 7283.5917650566. The cubic root of 53050709 is about 375.7483344024.

The spelling of 53050709 in words is "fifty-three million, fifty thousand, seven hundred nine".