For less than the price of an exercise booklet, keep this website updated
487is an odd number,as it is not divisible by 2
The factors for 487 are all the numbers between -487 and 487 , which divide 487 without leaving any remainder. Since 487 divided by -487 is an integer, -487 is a factor of 487 .
Since 487 divided by -487 is a whole number, -487 is a factor of 487
Since 487 divided by -1 is a whole number, -1 is a factor of 487
Since 487 divided by 1 is a whole number, 1 is a factor of 487
Multiples of 487 are all integers divisible by 487 , i.e. the remainder of the full division by 487 is zero. There are infinite multiples of 487. The smallest multiples of 487 are:
0 : in fact, 0 is divisible by any integer, so it is also a multiple of 487 since 0 × 487 = 0
487 : in fact, 487 is a multiple of itself, since 487 is divisible by 487 (it was 487 / 487 = 1, so the rest of this division is zero)
etc.
It is possible to determine using mathematical techniques whether an integer is prime or not.
for 487, the answer is: yes, 487 is a prime number because it only has two different divisors: 1 and itself (487).
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 487). 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 22.068 ). 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: ... 485, 486
Previous prime number: 479
Next prime number: 491