Search a number
-
+
130217026697 is a prime number
BaseRepresentation
bin111100101000110001…
…0100010010010001001
3110110010001022100021122
41321101202202102021
54113141024323242
6135453150445025
712256620315152
oct1712142422211
9413101270248
10130217026697
115025213153a
12212a1503775
13c382b40ab4
146434240929
1535c1e32ad2
hex1e518a2489

130217026697 has 2 divisors, whose sum is σ = 130217026698. Its totient is φ = 130217026696.

The previous prime is 130217026679. The next prime is 130217026741. The reversal of 130217026697 is 796620712031.

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

It is an a-pointer prime, because the next prime (130217026741) can be obtained adding 130217026697 to its sum of digits (44).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 67864939081 + 62352087616 = 260509^2 + 249704^2 .

It is an emirp because it is prime and its reverse (796620712031) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 130217026697 - 230 = 129143284873 is a prime.

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

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

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

Almost surely, 2130217026697 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 190512, while the sum is 44.

The spelling of 130217026697 in words is "one hundred thirty billion, two hundred seventeen million, twenty-six thousand, six hundred ninety-seven".