Search a number
-
+
5600626552093 is a prime number
BaseRepresentation
bin101000101111111111101…
…0110110010110100011101
3201211102012021221022210111
41101133333112302310131
51213230040344131333
615524520424010021
71115426514134506
oct121377726626435
921742167838714
105600626552093
11186a237753a01
12765532600911
133181a1785b51
14155100d25bad
159aa425a44cd
hex517ff5b2d1d

5600626552093 has 2 divisors, whose sum is σ = 5600626552094. Its totient is φ = 5600626552092.

The previous prime is 5600626552039. The next prime is 5600626552139. The reversal of 5600626552093 is 3902556260065.

Together with previous prime (5600626552039) 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., 3380460991609 + 2220165560484 = 1838603^2 + 1490022^2 .

It is a cyclic number.

It is not a de Polignac number, because 5600626552093 - 29 = 5600626551581 is a prime.

It is a congruent number.

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

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

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

Almost surely, 25600626552093 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2916000, while the sum is 49.

The spelling of 5600626552093 in words is "five trillion, six hundred billion, six hundred twenty-six million, five hundred fifty-two thousand, ninety-three".