Search a number
-
+
53660514041 is a prime number
BaseRepresentation
bin110001111110011010…
…100111011011111001
312010111200201112212222
4301332122213123321
51334344042422131
640352403013425
73606520562231
oct617632473371
9163450645788
1053660514041
1120836a63472
12a49696a275
1350a2249a74
142850952cc1
1515e0e0b87b
hexc7e6a76f9

53660514041 has 2 divisors, whose sum is σ = 53660514042. Its totient is φ = 53660514040.

The previous prime is 53660513993. The next prime is 53660514049. The reversal of 53660514041 is 14041506635.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 53654773225 + 5740816 = 231635^2 + 2396^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-53660514041 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

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

Almost surely, 253660514041 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 53660514041 in words is "fifty-three billion, six hundred sixty million, five hundred fourteen thousand, forty-one".