Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,068; 200,000,000,847) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,068 = 22 × 3 × 7 × 1,190,477
100,000,068 is not a prime number but a composite one.
200,000,000,847 = 3 × 73 × 913,242,013
200,000,000,847 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,847 ÷ 100,000,068 = 1,999 + 99,864,915
Step 2. Divide the smaller number by the above operation's remainder:
100,000,068 ÷ 99,864,915 = 1 + 135,153
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,864,915 ÷ 135,153 = 738 + 122,001
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
135,153 ÷ 122,001 = 1 + 13,152
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
122,001 ÷ 13,152 = 9 + 3,633
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,152 ÷ 3,633 = 3 + 2,253
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,633 ÷ 2,253 = 1 + 1,380
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,253 ÷ 1,380 = 1 + 873
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,380 ÷ 873 = 1 + 507
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
873 ÷ 507 = 1 + 366
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
507 ÷ 366 = 1 + 141
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
366 ÷ 141 = 2 + 84
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
141 ÷ 84 = 1 + 57
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
84 ÷ 57 = 1 + 27
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
57 ÷ 27 = 2 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
27 ÷ 3 = 9 + 0
At this step, the remainder is zero, so we stop:
3 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,068; 200,000,000,847) = 3
The two numbers have common prime factors