# Divisors of 767

## Divisors of 767

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

Accordingly:

767 is multiplo of 1

767 is multiplo of 13

767 is multiplo of 59

767 has 3 positive divisors

## Parity of 767

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

## The factors for 767

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

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

Since 767 divided by -59 is a whole number, -59 is a factor of 767

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

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

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

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

Since 767 divided by 59 is a whole number, 59 is a factor of 767

## What are the multiples of 767?

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

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

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

1534: in fact, 1534 = 767 × 2

2301: in fact, 2301 = 767 × 3

3068: in fact, 3068 = 767 × 4

3835: in fact, 3835 = 767 × 5

etc.

## Is 767 a prime number?

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

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