# Divisors of 489

## Divisors of 489

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

Accordingly:

489 is multiplo of 1

489 is multiplo of 3

489 is multiplo of 163

489 has 3 positive divisors

## Parity of 489

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

## The factors for 489

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

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

Since 489 divided by -163 is a whole number, -163 is a factor of 489

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

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

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

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

Since 489 divided by 163 is a whole number, 163 is a factor of 489

## What are the multiples of 489?

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

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

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

978: in fact, 978 = 489 × 2

1467: in fact, 1467 = 489 × 3

1956: in fact, 1956 = 489 × 4

2445: in fact, 2445 = 489 × 5

etc.

## Is 489 a prime number?

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

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