Is 489 a prime number?

It is possible to find out using mathematical methods whether a given integer is a prime number or not.

For 489, the answer is: No, 489 is not a prime number.

The list of all positive divisors (i.e., the list of all integers that divide 489) is as follows: 1, 3, 163, 489.

For 489 to be a prime number, it would have been required that 489 has only two divisors, i.e., itself and 1.

Find out more:

What is a prime number?

As a consequence:

489 is a multiple of 1
489 is a multiple of 3
489 is a multiple of 163

For 489 to be a prime number, it would have been required that 489 has only two divisors, i.e., itself and 1.

However, 489 is a semiprime (also called biprime or 2-almost-prime), because it is the product of a two non-necessarily distinct prime numbers. Indeed, 489 = 3 x 163, where 3 and 163 are both prime numbers.

Is 489 a deficient number?

Yes, 489 is a deficient number, that is to say 489 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 489 without 489 itself (that is 1 + 3 + 163 = 167).

Parity of 489

489 is an odd number, because it is not evenly divisible by 2.

Find out more:

What is an even number?

Is 489 a perfect square number?

A number is a perfect square (or a square number) if its square root is an integer; that is to say, it is the product of an integer with itself. Here, the square root of 489 is about 22.113.

Thus, the square root of 489 is not an integer, and therefore 489 is not a square number.

What is the square number of 489?

The square of a number (here 489) is the result of the product of this number (489) by itself (i.e., 489 × 489); the square of 489 is sometimes called "raising 489 to the power 2", or "489 squared".

The square of 489 is 239 121 because 489 × 489 = 489² = 239 121.

As a consequence, 489 is the square root of 239 121.

Number of digits of 489

489 is a number with 3 digits.

What are the multiples of 489?

The multiples of 489 are all integers evenly divisible by 489, that is all numbers such that the remainder of the division by 489 is zero. There are infinitely many multiples of 489. The smallest multiples of 489 are:

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 489 too, since 0 × 489 = 0
489: indeed, 489 is a multiple of itself, since 489 is evenly divisible by 489 (we have 489 / 489 = 1, so the remainder of this division is indeed zero)
978: indeed, 978 = 489 × 2
1 467: indeed, 1 467 = 489 × 3
1 956: indeed, 1 956 = 489 × 4
2 445: indeed, 2 445 = 489 × 5
etc.

How to determine whether an integer is a prime number?

To determine the primality of a number, several algorithms can be used. The most naive technique is to test all divisors strictly smaller to the number of which we want to determine the primality (here 489). First, we can eliminate all even numbers greater than 2 (and hence 4, 6, 8…). Then, we can stop this check when we reach the square root of the number of which we want to determine the primality (here the square root is about 22.113). Historically, the sieve of Eratosthenes (dating from the Greek mathematics) implements this technique in a relatively efficient manner.

More modern techniques include the sieve of Atkin, probabilistic algorithms, and the cyclotomic AKS test.

Numbers near 489

Preceding numbers: …487, 488
Following numbers: 490, 491…

Nearest numbers from 489

Preceding prime number: 487
Following prime number: 491