Search a number
-
+
10605005500601 is a prime number
BaseRepresentation
bin1001101001010010101110…
…0101011111000010111001
31101112211101001211002021202
42122110223211133002321
52342223022402004401
634315512224343545
72143120631266451
oct232245345370271
941484331732252
1010605005500601
113419615151276
1212333a2a74bb5
135bc080b1c1b5
142893dc0a6d61
15135cd945206b
hex9a52b95f0b9

10605005500601 has 2 divisors, whose sum is σ = 10605005500602. Its totient is φ = 10605005500600.

The previous prime is 10605005500577. The next prime is 10605005500673. The reversal of 10605005500601 is 10600550050601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5790645453376 + 4814360047225 = 2406376^2 + 2194165^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10605005500601 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 210605005500601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 29.

The spelling of 10605005500601 in words is "ten trillion, six hundred five billion, five million, five hundred thousand, six hundred one".