# Divisors of 637

## Divisors of 637

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

Accordingly:

637 is multiplo of 1

637 is multiplo of 7

637 is multiplo of 13

637 is multiplo of 49

637 is multiplo of 91

637 has 5 positive divisors

## Parity of 637

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

## The factors for 637

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

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

Since 637 divided by -91 is a whole number, -91 is a factor of 637

Since 637 divided by -49 is a whole number, -49 is a factor of 637

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

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

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

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

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

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

Since 637 divided by 49 is a whole number, 49 is a factor of 637

Since 637 divided by 91 is a whole number, 91 is a factor of 637

## What are the multiples of 637?

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

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

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

1274: in fact, 1274 = 637 × 2

1911: in fact, 1911 = 637 × 3

2548: in fact, 2548 = 637 × 4

3185: in fact, 3185 = 637 × 5

etc.

## Is 637 a prime number?

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

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