Search a number
-
+
5620715015141 is a prime number
BaseRepresentation
bin101000111001010110010…
…1110001100101111100101
3201220100001021220222112102
41101302230232030233211
51214042211020441031
615542042033301445
71120040362223252
oct121625456145745
921810037828472
105620715015141
111877806104586
127693ba104885
1331a053594c85
14156088c78429
159b31ae967cb
hex51cacb8cbe5

5620715015141 has 2 divisors, whose sum is σ = 5620715015142. Its totient is φ = 5620715015140.

The previous prime is 5620715015107. The next prime is 5620715015189. The reversal of 5620715015141 is 1415105170265.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3798390510916 + 1822324504225 = 1948946^2 + 1349935^2 .

It is a cyclic number.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (5620715015341) 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, 2810357507570 + 2810357507571.

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

Almost surely, 25620715015141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 42000, while the sum is 38.

The spelling of 5620715015141 in words is "five trillion, six hundred twenty billion, seven hundred fifteen million, fifteen thousand, one hundred forty-one".