Search a number
-
+
53021504537 is a prime number
BaseRepresentation
bin110001011000010100…
…111111010000011001
312001212011022111122022
4301120110333100121
51332042001121122
640205134504225
73554631231611
oct613024772031
9161764274568
1053021504537
1120539291141
12a338965075
134ccca43431
1427cdb33a41
1515a4c85642
hexc5853f419

53021504537 has 2 divisors, whose sum is σ = 53021504538. Its totient is φ = 53021504536.

The previous prime is 53021504531. The next prime is 53021504581. The reversal of 53021504537 is 73540512035.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 48892285456 + 4129219081 = 221116^2 + 64259^2 .

It is a cyclic number.

It is not a de Polignac number, because 53021504537 - 222 = 53017310233 is a prime.

It is a super-2 number, since 2×530215045372 (a number of 22 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 53021504497 and 53021504506.

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

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

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

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

Almost surely, 253021504537 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 53021504537 in words is "fifty-three billion, twenty-one million, five hundred four thousand, five hundred thirty-seven".