Search a number
-
+
131913402161 is a prime number
BaseRepresentation
bin111101011011010100…
…1101100011100110001
3110121111021100010221112
41322312221230130301
54130124312332121
6140333350003105
712346636263212
oct1726651543461
9417437303845
10131913402161
1150a42749532
1221695646495
13c59341b668
146555661409
153670d1c75b
hex1eb6a6c731

131913402161 has 2 divisors, whose sum is σ = 131913402162. Its totient is φ = 131913402160.

The previous prime is 131913402151. The next prime is 131913402163. The reversal of 131913402161 is 161204319131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 96989267761 + 34924134400 = 311431^2 + 186880^2 .

It is a cyclic number.

It is not a de Polignac number, because 131913402161 - 226 = 131846293297 is a prime.

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

It is a Sophie Germain prime.

Together with 131913402163, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

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

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

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

Almost surely, 2131913402161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 32.

The spelling of 131913402161 in words is "one hundred thirty-one billion, nine hundred thirteen million, four hundred two thousand, one hundred sixty-one".