31721is an odd number,as it is not divisible by 2
The factors for 31721 are all the numbers between -31721 and 31721 , which divide 31721 without leaving any remainder. Since 31721 divided by -31721 is an integer, -31721 is a factor of 31721 .
Since 31721 divided by -31721 is a whole number, -31721 is a factor of 31721
Since 31721 divided by -1 is a whole number, -1 is a factor of 31721
Since 31721 divided by 1 is a whole number, 1 is a factor of 31721
Multiples of 31721 are all integers divisible by 31721 , i.e. the remainder of the full division by 31721 is zero. There are infinite multiples of 31721. The smallest multiples of 31721 are:
0 : in fact, 0 is divisible by any integer, so it is also a multiple of 31721 since 0 × 31721 = 0
31721 : in fact, 31721 is a multiple of itself, since 31721 is divisible by 31721 (it was 31721 / 31721 = 1, so the rest of this division is zero)
63442: in fact, 63442 = 31721 × 2
95163: in fact, 95163 = 31721 × 3
126884: in fact, 126884 = 31721 × 4
158605: in fact, 158605 = 31721 × 5
etc.
It is possible to determine using mathematical techniques whether an integer is prime or not.
for 31721, the answer is: yes, 31721 is a prime number because it only has two different divisors: 1 and itself (31721).
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 31721). 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 178.104 ). 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 Numbers: ... 31719, 31720
Next Numbers: 31722, 31723 ...
Previous prime number: 31699
Next prime number: 31723