Search a number
-
+
560245196213 is a prime number
BaseRepresentation
bin10000010011100010011…
…01110100010110110101
31222120002110011202221222
420021301031310112311
533134340232234323
61105212330520125
755322253410663
oct10116115642665
91876073152858
10560245196213
111a666489805a
12906b4b96045
1340aa5627c81
141d18a4a1c33
15e88eb6b9c8
hex82713745b5

560245196213 has 2 divisors, whose sum is σ = 560245196214. Its totient is φ = 560245196212.

The previous prime is 560245196207. The next prime is 560245196321. The reversal of 560245196213 is 312691542065.

Together with next prime (560245196321) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 394174275889 + 166070920324 = 627833^2 + 407518^2 .

It is a cyclic number.

It is not a de Polignac number, because 560245196213 - 28 = 560245195957 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2560245196213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 388800, while the sum is 44.

The spelling of 560245196213 in words is "five hundred sixty billion, two hundred forty-five million, one hundred ninety-six thousand, two hundred thirteen".