# Divisors of 1689

## Divisors of 1689

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

Accordingly:

1689 is multiplo of 1

1689 is multiplo of 3

1689 is multiplo of 563

1689 has 3 positive divisors

## Parity of 1689

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

## The factors for 1689

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

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

Since 1689 divided by -563 is a whole number, -563 is a factor of 1689

Since 1689 divided by -3 is a whole number, -3 is a factor of 1689

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

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

Since 1689 divided by 3 is a whole number, 3 is a factor of 1689

Since 1689 divided by 563 is a whole number, 563 is a factor of 1689

## What are the multiples of 1689?

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

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

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

3378: in fact, 3378 = 1689 × 2

5067: in fact, 5067 = 1689 × 3

6756: in fact, 6756 = 1689 × 4

8445: in fact, 8445 = 1689 × 5

etc.

## Is 1689 a prime number?

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

for 1689, the answer is: No, 1689 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 1689). 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 41.097 ). 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.