Search a number
-
+
130209517157 is a prime number
BaseRepresentation
bin111100101000100010…
…1111000111001100101
3110110002112011211010112
41321101011320321211
54113132114022112
6135452321502405
712256466430356
oct1712105707145
9413075154115
10130209517157
1150248972505
122129aaa1a05
13c381411995
146433247d2d
1535c144ca22
hex1e51178e65

130209517157 has 2 divisors, whose sum is σ = 130209517158. Its totient is φ = 130209517156.

The previous prime is 130209517153. The next prime is 130209517199. The reversal of 130209517157 is 751715902031.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 127396169476 + 2813347681 = 356926^2 + 53041^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 130209517157 - 22 = 130209517153 is a prime.

It is a congruent number.

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

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

Almost surely, 2130209517157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 66150, while the sum is 41.

The spelling of 130209517157 in words is "one hundred thirty billion, two hundred nine million, five hundred seventeen thousand, one hundred fifty-seven".