Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,008; 200,000,000,330) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,008 = 23 × 34 × 154,321
100,000,008 is not a prime number but a composite one.
200,000,000,330 = 2 × 5 × 13 × 61 × 25,220,681
200,000,000,330 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,330 ÷ 100,000,008 = 1,999 + 99,984,338
Step 2. Divide the smaller number by the above operation's remainder:
100,000,008 ÷ 99,984,338 = 1 + 15,670
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,984,338 ÷ 15,670 = 6,380 + 9,738
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
15,670 ÷ 9,738 = 1 + 5,932
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,738 ÷ 5,932 = 1 + 3,806
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,932 ÷ 3,806 = 1 + 2,126
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,806 ÷ 2,126 = 1 + 1,680
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,126 ÷ 1,680 = 1 + 446
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,680 ÷ 446 = 3 + 342
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
446 ÷ 342 = 1 + 104
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
342 ÷ 104 = 3 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
104 ÷ 30 = 3 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 14 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 2 = 7 + 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,008; 200,000,000,330) = 2
The two numbers have common prime factors