# Divisors of 801

## Divisors of 801

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

Accordingly:

801 is multiplo of 1

801 is multiplo of 3

801 is multiplo of 9

801 is multiplo of 89

801 is multiplo of 267

801 has 5 positive divisors

## Parity of 801

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

## The factors for 801

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

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

Since 801 divided by -267 is a whole number, -267 is a factor of 801

Since 801 divided by -89 is a whole number, -89 is a factor of 801

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

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

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

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

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

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

Since 801 divided by 89 is a whole number, 89 is a factor of 801

Since 801 divided by 267 is a whole number, 267 is a factor of 801

## What are the multiples of 801?

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

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

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

1602: in fact, 1602 = 801 × 2

2403: in fact, 2403 = 801 × 3

3204: in fact, 3204 = 801 × 4

4005: in fact, 4005 = 801 × 5

etc.

## Is 801 a prime number?

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

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