Search a number
-
+
530216958881 is a prime number
BaseRepresentation
bin1111011011100110110…
…01001011101110100001
31212200120201202021020202
413231303121023232201
532141341020141011
61043324525314545
753210161534361
oct7556331135641
91780521667222
10530216958881
11194955717995
1286914705a55
133accb4572bc
141b93c3c69a1
15dbd381623b
hex7b7364bba1

530216958881 has 2 divisors, whose sum is σ = 530216958882. Its totient is φ = 530216958880.

The previous prime is 530216958853. The next prime is 530216958937. The reversal of 530216958881 is 188859612035.

It is an a-pointer prime, because the next prime (530216958937) can be obtained adding 530216958881 to its sum of digits (56).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 407605633600 + 122611325281 = 638440^2 + 350159^2 .

It is a cyclic number.

It is not a de Polignac number, because 530216958881 - 238 = 255339051937 is a prime.

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

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

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

Almost surely, 2530216958881 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4147200, while the sum is 56.

The spelling of 530216958881 in words is "five hundred thirty billion, two hundred sixteen million, nine hundred fifty-eight thousand, eight hundred eighty-one".