# Divisors of 981

## Divisors of 981

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

Accordingly:

981 is multiplo of 1

981 is multiplo of 3

981 is multiplo of 9

981 is multiplo of 109

981 is multiplo of 327

981 has 5 positive divisors

## Parity of 981

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

## The factors for 981

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

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

Since 981 divided by -327 is a whole number, -327 is a factor of 981

Since 981 divided by -109 is a whole number, -109 is a factor of 981

Since 981 divided by -9 is a whole number, -9 is a factor of 981

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

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

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

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

Since 981 divided by 9 is a whole number, 9 is a factor of 981

Since 981 divided by 109 is a whole number, 109 is a factor of 981

Since 981 divided by 327 is a whole number, 327 is a factor of 981

## What are the multiples of 981?

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

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

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

1962: in fact, 1962 = 981 × 2

2943: in fact, 2943 = 981 × 3

3924: in fact, 3924 = 981 × 4

4905: in fact, 4905 = 981 × 5

etc.

## Is 981 a prime number?

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

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