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