Search a number
-
+
530450906957 is a prime number
BaseRepresentation
bin1111011100000010101…
…01100111111101001101
31212201012000222001200022
413232001111213331031
532142330413010312
61043404043511525
753216032212626
oct7560125477515
91781160861608
10530450906957
11194a65787604
128697ab285a5
133b037a6960a
141b9614c4a4d
15dbe9129172
hex7b81567f4d

530450906957 has 2 divisors, whose sum is σ = 530450906958. Its totient is φ = 530450906956.

The previous prime is 530450906939. The next prime is 530450906981. The reversal of 530450906957 is 759609054035.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 334568539561 + 195882367396 = 578419^2 + 442586^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 530450906899 and 530450906908.

It is a congruent number.

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

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

Almost surely, 2530450906957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5103000, while the sum is 53.

The spelling of 530450906957 in words is "five hundred thirty billion, four hundred fifty million, nine hundred six thousand, nine hundred fifty-seven".