Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,106; 200,000,000,488) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,106 = 2 × 61 × 819,673
100,000,106 is not a prime number but a composite one.
200,000,000,488 = 23 × 541 × 2,239 × 20,639
200,000,000,488 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,488 ÷ 100,000,106 = 1,999 + 99,788,594
Step 2. Divide the smaller number by the above operation's remainder:
100,000,106 ÷ 99,788,594 = 1 + 211,512
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,788,594 ÷ 211,512 = 471 + 166,442
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
211,512 ÷ 166,442 = 1 + 45,070
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
166,442 ÷ 45,070 = 3 + 31,232
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
45,070 ÷ 31,232 = 1 + 13,838
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
31,232 ÷ 13,838 = 2 + 3,556
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,838 ÷ 3,556 = 3 + 3,170
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,556 ÷ 3,170 = 1 + 386
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,170 ÷ 386 = 8 + 82
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
386 ÷ 82 = 4 + 58
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
82 ÷ 58 = 1 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
58 ÷ 24 = 2 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 10 = 2 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 4 = 2 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
4 ÷ 2 = 2 + 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,106; 200,000,000,488) = 2
The two numbers have common prime factors