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