Search a number
-
+
530411951413 is a prime number
BaseRepresentation
bin1111011011111110000…
…01000001010100110101
31212201002022122220201101
413231333001001110311
532142240424421123
61043400132530101
753215050124621
oct7557701012465
91781068586641
10530411951413
11194a4579a743
1286969a80931
133b02c97a2b6
141b95a264181
15dbe59d1aad
hex7b7f041535

530411951413 has 2 divisors, whose sum is σ = 530411951414. Its totient is φ = 530411951412.

The previous prime is 530411951411. The next prime is 530411951431. The reversal of 530411951413 is 314159114035.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 529462880164 + 949071249 = 727642^2 + 30807^2 .

It is a cyclic number.

It is not a de Polignac number, because 530411951413 - 21 = 530411951411 is a prime.

Together with 530411951411, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (530411951411) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265205975706 + 265205975707.

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

Almost surely, 2530411951413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32400, while the sum is 37.

The spelling of 530411951413 in words is "five hundred thirty billion, four hundred eleven million, nine hundred fifty-one thousand, four hundred thirteen".