# Divisors of 427

## Divisors of 427

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

Accordingly:

427 is multiplo of 1

427 is multiplo of 7

427 is multiplo of 61

427 has 3 positive divisors

## Parity of 427

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

## The factors for 427

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

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

Since 427 divided by -61 is a whole number, -61 is a factor of 427

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

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

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

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

Since 427 divided by 61 is a whole number, 61 is a factor of 427

## What are the multiples of 427?

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

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

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

854: in fact, 854 = 427 × 2

1281: in fact, 1281 = 427 × 3

1708: in fact, 1708 = 427 × 4

2135: in fact, 2135 = 427 × 5

etc.

## Is 427 a prime number?

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

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