# Divisors of 387

## Divisors of 387

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

Accordingly:

387 is multiplo of 1

387 is multiplo of 3

387 is multiplo of 9

387 is multiplo of 43

387 is multiplo of 129

387 has 5 positive divisors

## Parity of 387

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

## The factors for 387

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

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

Since 387 divided by -129 is a whole number, -129 is a factor of 387

Since 387 divided by -43 is a whole number, -43 is a factor of 387

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

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

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

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

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

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

Since 387 divided by 43 is a whole number, 43 is a factor of 387

Since 387 divided by 129 is a whole number, 129 is a factor of 387

## What are the multiples of 387?

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

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

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

774: in fact, 774 = 387 × 2

1161: in fact, 1161 = 387 × 3

1548: in fact, 1548 = 387 × 4

1935: in fact, 1935 = 387 × 5

etc.

## Is 387 a prime number?

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

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