Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,038; 200,000,000,234) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,038 = 2 × 3 × 1,303 × 12,791
100,000,038 is not a prime number but a composite one.
200,000,000,234 = 2 × 457 × 218,818,381
200,000,000,234 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,234 ÷ 100,000,038 = 1,999 + 99,924,272
Step 2. Divide the smaller number by the above operation's remainder:
100,000,038 ÷ 99,924,272 = 1 + 75,766
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,924,272 ÷ 75,766 = 1,318 + 64,684
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,766 ÷ 64,684 = 1 + 11,082
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
64,684 ÷ 11,082 = 5 + 9,274
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
11,082 ÷ 9,274 = 1 + 1,808
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,274 ÷ 1,808 = 5 + 234
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,808 ÷ 234 = 7 + 170
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
234 ÷ 170 = 1 + 64
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
170 ÷ 64 = 2 + 42
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
64 ÷ 42 = 1 + 22
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
42 ÷ 22 = 1 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
22 ÷ 20 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 2 = 10 + 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,038; 200,000,000,234) = 2
The two numbers have common prime factors