Search a number
-
+
10560050011001 is a prime number
BaseRepresentation
bin1001100110101011010000…
…0001111001101101111001
31101101112100001010121000102
42121222310001321231321
52341003440300323001
634243115304245145
72136636612033221
oct231526401715571
941345301117012
1010560050011001
113401545a27587
1212267374707b5
135b7a681c388a
14287175703081
15134a578a6e6b
hex99ab4079b79

10560050011001 has 2 divisors, whose sum is σ = 10560050011002. Its totient is φ = 10560050011000.

The previous prime is 10560050010971. The next prime is 10560050011009. The reversal of 10560050011001 is 10011005006501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5346842280976 + 5213207730025 = 2312324^2 + 2283245^2 .

It is a cyclic number.

It is not a de Polignac number, because 10560050011001 - 214 = 10560049994617 is a prime.

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

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

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

Almost surely, 210560050011001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 150, while the sum is 20.

Adding to 10560050011001 its reverse (10011005006501), we get a palindrome (20571055017502).

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