Search a number
-
+
10560510550561 is a prime number
BaseRepresentation
bin1001100110101100111101…
…1110101110001000100001
31101101120112010201102112011
42121223033132232020201
52341010411200104221
634243233115232521
72136654203410156
oct231531736561041
941346463642464
1010560510550561
113401761991794
121226845748741
135b7b0c7408aa
142871ba94622d
15134a830281e1
hex99acf7ae221

10560510550561 has 2 divisors, whose sum is σ = 10560510550562. Its totient is φ = 10560510550560.

The previous prime is 10560510550547. The next prime is 10560510550567. The reversal of 10560510550561 is 16505501506501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9168063350161 + 1392447200400 = 3027881^2 + 1180020^2 .

It is a cyclic number.

It is not a de Polignac number, because 10560510550561 - 29 = 10560510550049 is a prime.

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

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

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

Almost surely, 210560510550561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 112500, while the sum is 40.

The spelling of 10560510550561 in words is "ten trillion, five hundred sixty billion, five hundred ten million, five hundred fifty thousand, five hundred sixty-one".