# Divisors of 13

## Divisors of 13

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

Accordingly:

13 is multiplo of 1

13 has 1 positive divisors

## Parity of 13

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

## The factors for 13

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

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

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

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

## What are the multiples of 13?

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

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

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

26: in fact, 26 = 13 × 2

39: in fact, 39 = 13 × 3

52: in fact, 52 = 13 × 4

65: in fact, 65 = 13 × 5

etc.

## Is 13 a prime number?

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

for 13, the answer is: yes, 13 is a prime number because it only has two different divisors: 1 and itself (13).

## 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 13). 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 3.606 ). 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.