Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,108; 200,000,000,462) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,108 = 22 × 13 × 1,923,079
100,000,108 is not a prime number but a composite one.
200,000,000,462 = 2 × 23 × 15,161 × 286,777
200,000,000,462 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:
200,000,000,462 ÷ 100,000,108 = 1,999 + 99,784,570
Step 2. Divide the smaller number by the above operation's remainder:
100,000,108 ÷ 99,784,570 = 1 + 215,538
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,784,570 ÷ 215,538 = 462 + 206,014
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
215,538 ÷ 206,014 = 1 + 9,524
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
206,014 ÷ 9,524 = 21 + 6,010
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,524 ÷ 6,010 = 1 + 3,514
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,010 ÷ 3,514 = 1 + 2,496
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,514 ÷ 2,496 = 1 + 1,018
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,496 ÷ 1,018 = 2 + 460
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,018 ÷ 460 = 2 + 98
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
460 ÷ 98 = 4 + 68
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
98 ÷ 68 = 1 + 30
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
68 ÷ 30 = 2 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
30 ÷ 8 = 3 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 6 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 2 = 3 + 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 (100,000,108; 200,000,000,462) = 2
The two numbers have common prime factors