Search a number
-
+
10661512517 is a prime number
BaseRepresentation
bin10011110110111100…
…11100010101000101
31000112000111221200222
421323132130111011
5133313321400032
64521533114125
7525126234605
oct117336342505
930460457628
1010661512517
114581167177
122096628945
13100ba725b6
14731d5cc05
15425ecba12
hex27b79c545

10661512517 has 2 divisors, whose sum is σ = 10661512518. Its totient is φ = 10661512516.

The previous prime is 10661512457. The next prime is 10661512523. The reversal of 10661512517 is 71521516601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10644874276 + 16638241 = 103174^2 + 4079^2 .

It is an emirp because it is prime and its reverse (71521516601) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10661512517 - 26 = 10661512453 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210661512517 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12600, while the sum is 35.

The spelling of 10661512517 in words is "ten billion, six hundred sixty-one million, five hundred twelve thousand, five hundred seventeen".