Search a number
-
+
530608125584153 is a prime number
BaseRepresentation
bin111100010100101011101010…
…0110101110010001100011001
32120120201122022120211220101002
41320221113110311302030121
51024021440420122143103
65120302001402434345
7216523112665621631
oct17051272465621431
92516648276756332
10530608125584153
11144082707a70021
124b6174ab8029b5
1319a0c1930040a6
1495057dacc56c1
154152505a9a488
hex1e295d4d72319

530608125584153 has 2 divisors, whose sum is σ = 530608125584154. Its totient is φ = 530608125584152.

The previous prime is 530608125584113. The next prime is 530608125584183. The reversal of 530608125584153 is 351485521806035.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 427117118243344 + 103491007340809 = 20666812^2 + 10173053^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 2530608125584153 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 530608125584153 in words is "five hundred thirty trillion, six hundred eight billion, one hundred twenty-five million, five hundred eighty-four thousand, one hundred fifty-three".