# Divisors of 243

## Divisors of 243

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

Accordingly:

243 is multiplo of 1

243 is multiplo of 3

243 is multiplo of 9

243 is multiplo of 27

243 is multiplo of 81

243 has 5 positive divisors

## Parity of 243

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

## The factors for 243

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

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

Since 243 divided by -81 is a whole number, -81 is a factor of 243

Since 243 divided by -27 is a whole number, -27 is a factor of 243

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

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

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

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

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

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

Since 243 divided by 27 is a whole number, 27 is a factor of 243

Since 243 divided by 81 is a whole number, 81 is a factor of 243

## What are the multiples of 243?

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

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

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

486: in fact, 486 = 243 × 2

729: in fact, 729 = 243 × 3

972: in fact, 972 = 243 × 4

1215: in fact, 1215 = 243 × 5

etc.

## Is 243 a prime number?

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

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