Search a number
131690231 is a prime number
BaseRepresentation
bin1111101100101…
…10111011110111
3100011210120000222
413312112323313
5232203041411
621022324555
73156230351
oct766267367
9304716028
10131690231
1168376902
123812975b
132138ac1a
14136c00d1
15b8644db
hex7d96ef7

131690231 has 2 divisors, whose sum is σ = 131690232. Its totient is φ = 131690230.

The previous prime is 131690227. The next prime is 131690233. The reversal of 131690231 is 132096131.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 131690231 - 22 = 131690227 is a prime.

It is a super-2 number, since 2×1316902312 = 34684633881666722, which contains 22 as substring.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 131690231.

It is a congruent number.

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

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

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

Almost surely, 2131690231 is an apocalyptic number.

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

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

131690231 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 972, while the sum is 26.

The square root of 131690231 is about 11475.6364093675. The cubic root of 131690231 is about 508.7657337668.

The spelling of 131690231 in words is "one hundred thirty-one million, six hundred ninety thousand, two hundred thirty-one".