Search a number
-
+
53715131131 is a prime number
BaseRepresentation
bin110010000001101010…
…111101101011111011
312010122111111101110011
4302001222331223323
51340002033144011
640402033402351
73611053036564
oct620152755373
9163574441404
1053715131131
1120864878062
12a4b11093b7
1350b066087c
142857ccd16b
1515e5ae9621
hexc81abdafb

53715131131 has 2 divisors, whose sum is σ = 53715131132. Its totient is φ = 53715131130.

The previous prime is 53715131069. The next prime is 53715131143. The reversal of 53715131131 is 13113151735.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 53715131131 - 213 = 53715122939 is a prime.

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

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

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

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

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

Almost surely, 253715131131 is an apocalyptic number.

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

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

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

The product of its digits is 4725, while the sum is 31.

Adding to 53715131131 its reverse (13113151735), we get a palindrome (66828282866).

The spelling of 53715131131 in words is "fifty-three billion, seven hundred fifteen million, one hundred thirty-one thousand, one hundred thirty-one".