In addition we can say of the number 470 that it is even
470 is an even number, as it is divisible by 2 : 470/2 = 235
The factors for 470 are all the numbers between -470 and 470 , which divide 470 without leaving any remainder. Since 470 divided by -470 is an integer, -470 is a factor of 470 .
Since 470 divided by -470 is a whole number, -470 is a factor of 470
Since 470 divided by -235 is a whole number, -235 is a factor of 470
Since 470 divided by -94 is a whole number, -94 is a factor of 470
Since 470 divided by -47 is a whole number, -47 is a factor of 470
Since 470 divided by -10 is a whole number, -10 is a factor of 470
Since 470 divided by -5 is a whole number, -5 is a factor of 470
Since 470 divided by -2 is a whole number, -2 is a factor of 470
Since 470 divided by -1 is a whole number, -1 is a factor of 470
Since 470 divided by 1 is a whole number, 1 is a factor of 470
Since 470 divided by 2 is a whole number, 2 is a factor of 470
Since 470 divided by 5 is a whole number, 5 is a factor of 470
Since 470 divided by 10 is a whole number, 10 is a factor of 470
Since 470 divided by 47 is a whole number, 47 is a factor of 470
Since 470 divided by 94 is a whole number, 94 is a factor of 470
Since 470 divided by 235 is a whole number, 235 is a factor of 470
Multiples of 470 are all integers divisible by 470 , i.e. the remainder of the full division by 470 is zero. There are infinite multiples of 470. The smallest multiples of 470 are:
0 : in fact, 0 is divisible by any integer, so it is also a multiple of 470 since 0 × 470 = 0
470 : in fact, 470 is a multiple of itself, since 470 is divisible by 470 (it was 470 / 470 = 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 470, the answer is: No, 470 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 470). 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 21.679 ). 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: ... 468, 469
Previous prime number: 467
Next prime number: 479