## Divisors of 145

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

Accordingly:

**145** is multiplo of **1**

**145** is multiplo of **5**

**145** is multiplo of **29**

**145** has **3 positive divisors **

## Parity of 145

**145is an odd number**,as it is not divisible by 2

## The factors for 145

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

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

Since 145 divided by -29 is a whole number, -29 is a factor of 145

Since 145 divided by -5 is a whole number, -5 is a factor of 145

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

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

Since 145 divided by 5 is a whole number, 5 is a factor of 145

Since 145 divided by 29 is a whole number, 29 is a factor of 145

## What are the multiples of 145?

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

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

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

290: in fact, 290 = 145 × 2

435: in fact, 435 = 145 × 3

580: in fact, 580 = 145 × 4

725: in fact, 725 = 145 × 5

etc.

## Is 145 a prime number?

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

for 145, the answer is:
**No, ****145** 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 145). 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 12.042 ). 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.

## Numbers about 145

Previous Numbers: ... 143, 144

Next Numbers: 146, 147 ...

## Prime numbers closer to 145

Previous prime number: 139

Next prime number: 149