Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,035; 200,000,000,379) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,035 = 33 × 5 × 17 × 43,573
100,000,035 is not a prime number but a composite one.
200,000,000,379 = 3 × 47 × 1,418,439,719
200,000,000,379 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,379 ÷ 100,000,035 = 1,999 + 99,930,414
Step 2. Divide the smaller number by the above operation's remainder:
100,000,035 ÷ 99,930,414 = 1 + 69,621
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,930,414 ÷ 69,621 = 1,435 + 24,279
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
69,621 ÷ 24,279 = 2 + 21,063
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
24,279 ÷ 21,063 = 1 + 3,216
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
21,063 ÷ 3,216 = 6 + 1,767
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,216 ÷ 1,767 = 1 + 1,449
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,767 ÷ 1,449 = 1 + 318
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,449 ÷ 318 = 4 + 177
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
318 ÷ 177 = 1 + 141
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
177 ÷ 141 = 1 + 36
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
141 ÷ 36 = 3 + 33
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
36 ÷ 33 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
33 ÷ 3 = 11 + 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,035; 200,000,000,379) = 3
The two numbers have common prime factors