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