Search a number
-
+
130537009573 is a prime number
BaseRepresentation
bin111100110010010011…
…1001011000110100101
3110110221100102011021021
41321210213023012211
54114314433301243
6135545021051141
712300554162635
oct1714447130645
9413840364237
10130537009573
11503a68143a3
12213706b6ab1
13c404217289
1464649366c5
1535e008c6ed
hex1e649cb1a5

130537009573 has 2 divisors, whose sum is σ = 130537009574. Its totient is φ = 130537009572.

The previous prime is 130537009553. The next prime is 130537009579. The reversal of 130537009573 is 375900735031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 122712191809 + 7824817764 = 350303^2 + 88458^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2130537009573 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 297675, while the sum is 43.

The spelling of 130537009573 in words is "one hundred thirty billion, five hundred thirty-seven million, nine thousand, five hundred seventy-three".