# Divisors of 1167

## Divisors of 1167

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

Accordingly:

1167 is multiplo of 1

1167 is multiplo of 3

1167 is multiplo of 389

1167 has 3 positive divisors

## Parity of 1167

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

## The factors for 1167

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

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

Since 1167 divided by -389 is a whole number, -389 is a factor of 1167

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

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

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

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

Since 1167 divided by 389 is a whole number, 389 is a factor of 1167

## What are the multiples of 1167?

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

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

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

2334: in fact, 2334 = 1167 × 2

3501: in fact, 3501 = 1167 × 3

4668: in fact, 4668 = 1167 × 4

5835: in fact, 5835 = 1167 × 5

etc.

## Is 1167 a prime number?

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

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