# Divisors of 689

## Divisors of 689

The list of all positive divisors (that is, the list of all integers that divide 22) is as follows :

Accordingly:

689 is multiplo of 1

689 is multiplo of 13

689 is multiplo of 53

689 has 3 positive divisors

## Parity of 689

689is an odd number,as it is not divisible by 2

## The factors for 689

The factors for 689 are all the numbers between -689 and 689 , which divide 689 without leaving any remainder. Since 689 divided by -689 is an integer, -689 is a factor of 689 .

Since 689 divided by -689 is a whole number, -689 is a factor of 689

Since 689 divided by -53 is a whole number, -53 is a factor of 689

Since 689 divided by -13 is a whole number, -13 is a factor of 689

Since 689 divided by -1 is a whole number, -1 is a factor of 689

Since 689 divided by 1 is a whole number, 1 is a factor of 689

Since 689 divided by 13 is a whole number, 13 is a factor of 689

Since 689 divided by 53 is a whole number, 53 is a factor of 689

## What are the multiples of 689?

Multiples of 689 are all integers divisible by 689 , i.e. the remainder of the full division by 689 is zero. There are infinite multiples of 689. The smallest multiples of 689 are:

0 : in fact, 0 is divisible by any integer, so it is also a multiple of 689 since 0 × 689 = 0

689 : in fact, 689 is a multiple of itself, since 689 is divisible by 689 (it was 689 / 689 = 1, so the rest of this division is zero)

1378: in fact, 1378 = 689 × 2

2067: in fact, 2067 = 689 × 3

2756: in fact, 2756 = 689 × 4

3445: in fact, 3445 = 689 × 5

etc.

## Is 689 a prime number?

It is possible to determine using mathematical techniques whether an integer is prime or not.

for 689, the answer is: No, 689 is not a prime number.

## How do you determine if a number is prime?

To know the primality of an integer, we can use several algorithms. The most naive is to try all divisors below the number you want to know if it is prime (in our case 689). We can already eliminate even numbers bigger than 2 (then 4 , 6 , 8 ...). Besides, we can stop at the square root of the number in question (here 26.249 ). Historically, the Eratosthenes screen (which dates back to Antiquity) uses this technique relatively effectively.

More modern techniques include the Atkin screen, probabilistic tests, or the cyclotomic test.