# Divisors of 355

## Divisors of 355

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

Accordingly:

355 is multiplo of 1

355 is multiplo of 5

355 is multiplo of 71

355 has 3 positive divisors

## Parity of 355

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

## The factors for 355

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

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

Since 355 divided by -71 is a whole number, -71 is a factor of 355

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

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

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

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

Since 355 divided by 71 is a whole number, 71 is a factor of 355

## What are the multiples of 355?

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

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

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

710: in fact, 710 = 355 × 2

1065: in fact, 1065 = 355 × 3

1420: in fact, 1420 = 355 × 4

1775: in fact, 1775 = 355 × 5

etc.

## Is 355 a prime number?

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

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