Search a number
-
+
53015502037 is a prime number
BaseRepresentation
bin110001010111111110…
…000101110011010101
312001211202000112202111
4301113332011303111
51332033432031122
640204402111021
73554526221611
oct612776056325
9161752015674
1053015502037
11205359613a3
12a33694b471
134ccb721264
1427cd010341
1515a449bd77
hexc57f85cd5

53015502037 has 2 divisors, whose sum is σ = 53015502038. Its totient is φ = 53015502036.

The previous prime is 53015501939. The next prime is 53015502073. The reversal of 53015502037 is 73020551035.

Together with next prime (53015502073) 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., 36898183921 + 16117318116 = 192089^2 + 126954^2 .

It is a cyclic number.

It is not a de Polignac number, because 53015502037 - 27 = 53015501909 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 253015502037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15750, while the sum is 31.

The spelling of 53015502037 in words is "fifty-three billion, fifteen million, five hundred two thousand, thirty-seven".