# Divisors of 143

## Divisors of 143

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

Accordingly:

143 is multiplo of 1

143 is multiplo of 11

143 is multiplo of 13

143 has 3 positive divisors

## Parity of 143

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

## The factors for 143

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

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

Since 143 divided by -13 is a whole number, -13 is a factor of 143

Since 143 divided by -11 is a whole number, -11 is a factor of 143

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

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

Since 143 divided by 11 is a whole number, 11 is a factor of 143

Since 143 divided by 13 is a whole number, 13 is a factor of 143

## What are the multiples of 143?

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

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

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

286: in fact, 286 = 143 × 2

429: in fact, 429 = 143 × 3

572: in fact, 572 = 143 × 4

715: in fact, 715 = 143 × 5

etc.

## Is 143 a prime number?

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

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