Search a number
-
+
10560354287213 is a prime number
BaseRepresentation
bin1001100110101100011000…
…1010100111111001101101
31101101120010020200102111202
42121223012022213321231
52341010101144142323
634243205414055245
72136650265242663
oct231530612477155
941346106612452
1010560354287213
113401691761825
12122680134a525
135b7ab625ab83
142871a3caac33
15134a7445cd28
hex99ac62a7e6d

10560354287213 has 2 divisors, whose sum is σ = 10560354287214. Its totient is φ = 10560354287212.

The previous prime is 10560354287209. The next prime is 10560354287293. The reversal of 10560354287213 is 31278245306501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9639547076644 + 920807210569 = 3104762^2 + 959587^2 .

It is a cyclic number.

It is not a de Polignac number, because 10560354287213 - 22 = 10560354287209 is a prime.

It is a super-2 number, since 2×105603542872132 (a number of 27 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 210560354287213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1209600, while the sum is 47.

The spelling of 10560354287213 in words is "ten trillion, five hundred sixty billion, three hundred fifty-four million, two hundred eighty-seven thousand, two hundred thirteen".