Search a number
-
+
530325212569 is a prime number
BaseRepresentation
bin1111011011110011101…
…10001000110110011001
31212200212021110010101121
413231321312020312121
532142101223300234
61043343353445241
753212644633655
oct7557166106631
91780767403347
10530325212569
11194a00836549
1286944a10821
133b0179ca839
141b94c925a65
15dbdd09b4b4
hex7b79d88d99

530325212569 has 2 divisors, whose sum is σ = 530325212570. Its totient is φ = 530325212568.

The previous prime is 530325212537. The next prime is 530325212581. The reversal of 530325212569 is 965212523035.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 465106268169 + 65218944400 = 681987^2 + 255380^2 .

It is a cyclic number.

It is not a de Polignac number, because 530325212569 - 25 = 530325212537 is a prime.

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

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

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

Almost surely, 2530325212569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486000, while the sum is 43.

The spelling of 530325212569 in words is "five hundred thirty billion, three hundred twenty-five million, two hundred twelve thousand, five hundred sixty-nine".