Search a number
-
+
130770526637 is a prime number
BaseRepresentation
bin111100111001010000…
…1111110000110101101
3110111112121211001110102
41321302201332012231
54120304223323022
6140024122120445
712306421064462
oct1716241760655
9414477731412
10130770526637
115050660a203
1221416950125
13c44070835a
146487961669
153605817a92
hex1e7287e1ad

130770526637 has 2 divisors, whose sum is σ = 130770526638. Its totient is φ = 130770526636.

The previous prime is 130770526543. The next prime is 130770526673. The reversal of 130770526637 is 736625077031.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 128540892676 + 2229633961 = 358526^2 + 47219^2 .

It is a cyclic number.

It is not a de Polignac number, because 130770526637 - 212 = 130770522541 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2130770526637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1111320, while the sum is 47.

The spelling of 130770526637 in words is "one hundred thirty billion, seven hundred seventy million, five hundred twenty-six thousand, six hundred thirty-seven".