The list of all positive divisors (that is, the list of all integers that divide 22) is as follows :
970 is multiplo of 1
970 is multiplo of 2
970 is multiplo of 5
970 is multiplo of 10
970 is multiplo of 97
970 is multiplo of 194
970 is multiplo of 485
970 has 7 positive divisors
In addition we can say of the number 970 that it is even
970 is an even number, as it is divisible by 2 : 970/2 = 485
The factors for 970 are all the numbers between -970 and 970 , which divide 970 without leaving any remainder. Since 970 divided by -970 is an integer, -970 is a factor of 970 .
Since 970 divided by -970 is a whole number, -970 is a factor of 970
Since 970 divided by -485 is a whole number, -485 is a factor of 970
Since 970 divided by -194 is a whole number, -194 is a factor of 970
Since 970 divided by -97 is a whole number, -97 is a factor of 970
Since 970 divided by -10 is a whole number, -10 is a factor of 970
Since 970 divided by -5 is a whole number, -5 is a factor of 970
Since 970 divided by -2 is a whole number, -2 is a factor of 970
Since 970 divided by -1 is a whole number, -1 is a factor of 970
Multiples of 970 are all integers divisible by 970 , i.e. the remainder of the full division by 970 is zero. There are infinite multiples of 970. The smallest multiples of 970 are:
It is possible to determine using mathematical techniques whether an integer is prime or not.
for 970, the answer is: No, 970 is not a prime number.
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 970). 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 31.145 ). 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.
Previous prime number: 967
Next prime number: 971