Search a number
-
+
12559009597 is a prime number
BaseRepresentation
bin10111011001001001…
…10100011100111101
31012102020222210100121
423230210310130331
5201210101301342
65434115054541
7623136551221
oct135444643475
935366883317
1012559009597
115365262882
122525ba1451
131251c0ab34
14871d74781
154d7893067
hex2ec93473d

12559009597 has 2 divisors, whose sum is σ = 12559009598. Its totient is φ = 12559009596.

The previous prime is 12559009579. The next prime is 12559009601. The reversal of 12559009597 is 79590095521.

Together with previous prime (12559009579) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9090859716 + 3468149881 = 95346^2 + 58891^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 12559009597 - 27 = 12559009469 is a prime.

It is a congruent number.

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

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

Almost surely, 212559009597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1275750, while the sum is 52.

The spelling of 12559009597 in words is "twelve billion, five hundred fifty-nine million, nine thousand, five hundred ninety-seven".