Search a number
-
+
530800505549 is a prime number
BaseRepresentation
bin1111011100101100010…
…11001111001011001101
31212202002101210111210022
413232112023033023031
532144034412134144
61043502452551525
753230505565536
oct7562613171315
91782071714708
10530800505549
11195125058166
1286a580225a5
133b092311ba2
141b995ac968d
15dc19b83cee
hex7b962cf2cd

530800505549 has 2 divisors, whose sum is σ = 530800505550. Its totient is φ = 530800505548.

The previous prime is 530800505461. The next prime is 530800505593. The reversal of 530800505549 is 945505008035.

It is an a-pointer prime, because the next prime (530800505593) can be obtained adding 530800505549 to its sum of digits (44).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 507167592649 + 23632912900 = 712157^2 + 153730^2 .

It is a cyclic number.

It is not a de Polignac number, because 530800505549 - 28 = 530800505293 is a prime.

It is a congruent number.

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

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

Almost surely, 2530800505549 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 540000, while the sum is 44.

The spelling of 530800505549 in words is "five hundred thirty billion, eight hundred million, five hundred five thousand, five hundred forty-nine".