Search a number
-
+
130566102169 is a prime number
BaseRepresentation
bin111100110011001011…
…0001001110010011001
3110111000101011012210211
41321212112021302121
54114344410232134
6135551540411121
712301356361666
oct1714626116231
9414011135724
10130566102169
1150411185068
122137a3a6aa1
13c40a262229
14646874aa6d
1535e28d7764
hex1e66589c99

130566102169 has 2 divisors, whose sum is σ = 130566102170. Its totient is φ = 130566102168.

The previous prime is 130566102143. The next prime is 130566102257. The reversal of 130566102169 is 961201665031.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 130149942169 + 416160000 = 360763^2 + 20400^2 .

It is a cyclic number.

It is not a de Polignac number, because 130566102169 - 25 = 130566102137 is a prime.

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

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

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

Almost surely, 2130566102169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 58320, while the sum is 40.

The spelling of 130566102169 in words is "one hundred thirty billion, five hundred sixty-six million, one hundred two thousand, one hundred sixty-nine".