Search a number
-
+
689131 is a prime number
BaseRepresentation
bin10101000001111101011
31022000022101
42220033223
5134023011
622434231
75600062
oct2501753
91260271
10689131
11430833
12292977
131b1891
1413d1d9
15d92c1
hexa83eb

689131 has 2 divisors, whose sum is σ = 689132. Its totient is φ = 689130.

The previous prime is 689113. The next prime is 689141. The reversal of 689131 is 131986.

It is a happy number.

Together with previous prime (689113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 689131 - 211 = 687083 is a prime.

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

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 689131.

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

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

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

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

2689131 is an apocalyptic number.

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

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

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

The product of its digits is 1296, while the sum is 28.

The square root of 689131 is about 830.1391449631. The cubic root of 689131 is about 88.3284471804.

It can be divided in two parts, 689 and 131, that added together give a triangular number (820 = T40).

The spelling of 689131 in words is "six hundred eighty-nine thousand, one hundred thirty-one".