Search a number
-
+
131491479661 is a prime number
BaseRepresentation
bin111101001110110000…
…0001100000001101101
3110120101212102021002021
41322131200030001231
54123243304322121
6140223434430141
712333324064363
oct1723540140155
9416355367067
10131491479661
115084656a953
1221598292351
13c526ba2889
1465155d1633
153648c78641
hex1e9d80c06d

131491479661 has 2 divisors, whose sum is σ = 131491479662. Its totient is φ = 131491479660.

The previous prime is 131491479617. The next prime is 131491479671. The reversal of 131491479661 is 166974194131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 74525724036 + 56965755625 = 272994^2 + 238675^2 .

It is a cyclic number.

It is not a de Polignac number, because 131491479661 - 211 = 131491477613 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2131491479661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 979776, while the sum is 52.

The spelling of 131491479661 in words is "one hundred thirty-one billion, four hundred ninety-one million, four hundred seventy-nine thousand, six hundred sixty-one".