# Divisors of 147

## Divisors of 147

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

Accordingly:

147 is multiplo of 1

147 is multiplo of 3

147 is multiplo of 7

147 is multiplo of 21

147 is multiplo of 49

147 has 5 positive divisors

## Parity of 147

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

## The factors for 147

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

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

Since 147 divided by -49 is a whole number, -49 is a factor of 147

Since 147 divided by -21 is a whole number, -21 is a factor of 147

Since 147 divided by -7 is a whole number, -7 is a factor of 147

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

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

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

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

Since 147 divided by 7 is a whole number, 7 is a factor of 147

Since 147 divided by 21 is a whole number, 21 is a factor of 147

Since 147 divided by 49 is a whole number, 49 is a factor of 147

## What are the multiples of 147?

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

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

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

294: in fact, 294 = 147 × 2

441: in fact, 441 = 147 × 3

588: in fact, 588 = 147 × 4

735: in fact, 735 = 147 × 5

etc.

## Is 147 a prime number?

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

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