Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (406,912; 1,504,198,490) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
406,912 = 27 × 11 × 172
406,912 is not a prime number but a composite one.
1,504,198,490 = 2 × 5 × 1,811 × 83,059
1,504,198,490 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly two factors: 1 and itself.
- Composite number: a natural number that has at least one other factor than 1 and itself.
Calculate the greatest (highest) common factor (divisor):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
1,504,198,490 ÷ 406,912 = 3,696 + 251,738
Step 2. Divide the smaller number by the above operation's remainder:
406,912 ÷ 251,738 = 1 + 155,174
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
251,738 ÷ 155,174 = 1 + 96,564
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
155,174 ÷ 96,564 = 1 + 58,610
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
96,564 ÷ 58,610 = 1 + 37,954
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
58,610 ÷ 37,954 = 1 + 20,656
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
37,954 ÷ 20,656 = 1 + 17,298
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
20,656 ÷ 17,298 = 1 + 3,358
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
17,298 ÷ 3,358 = 5 + 508
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,358 ÷ 508 = 6 + 310
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
508 ÷ 310 = 1 + 198
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
310 ÷ 198 = 1 + 112
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
198 ÷ 112 = 1 + 86
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
112 ÷ 86 = 1 + 26
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
86 ÷ 26 = 3 + 8
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
26 ÷ 8 = 3 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
8 ÷ 2 = 4 + 0
At this step, the remainder is zero, so we stop:
2 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (406,912; 1,504,198,490) = 2
The two numbers have common prime factors