Search a number
-
+
53715131 is a prime number
BaseRepresentation
bin1100110011101…
…0000010111011
310202002000022022
43030322002323
5102222341011
65155145055
71221366611
oct314720273
9122060268
1053715131
1128358a78
1215ba518b
13b189402
1471c36b1
154ab08db
hex333a0bb

53715131 has 2 divisors, whose sum is σ = 53715132. Its totient is φ = 53715130.

The previous prime is 53715119. The next prime is 53715139. The reversal of 53715131 is 13151735.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 53715131 - 222 = 49520827 is a prime.

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 53715131.

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

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

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

Almost surely, 253715131 is an apocalyptic number.

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

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

53715131 is an evil number, because the sum of its binary digits is even.

The product of its digits is 1575, while the sum is 26.

The square root of 53715131 is about 7329.0607174453. The cubic root of 53715131 is about 377.3104900877.

Adding to 53715131 its reverse (13151735), we get a palindrome (66866866).

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