Search a number
-
+
690507131 is a prime number
BaseRepresentation
bin101001001010000…
…100110101111011
31210010022101201012
4221022010311323
52403232212011
6152303544135
723053133216
oct5112046573
91703271635
10690507131
11324856256
121732bb04b
13b0097602
14679c677d
1540949a8b
hex29284d7b

690507131 has 2 divisors, whose sum is σ = 690507132. Its totient is φ = 690507130.

The previous prime is 690507121. The next prime is 690507133. The reversal of 690507131 is 131705096.

690507131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 690507131 - 210 = 690506107 is a prime.

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

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

It is a Chen prime.

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

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

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

Almost surely, 2690507131 is an apocalyptic number.

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

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

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

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

The square root of 690507131 is about 26277.5023737036. The cubic root of 690507131 is about 883.8720267338.

The spelling of 690507131 in words is "six hundred ninety million, five hundred seven thousand, one hundred thirty-one".