Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,038; 200,000,000,266) = ?
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,266 = 2 × 11 × 17 × 534,759,359
200,000,000,266 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,266 ÷ 100,000,038 = 1,999 + 99,924,304
Step 2. Divide the smaller number by the above operation's remainder:
100,000,038 ÷ 99,924,304 = 1 + 75,734
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,924,304 ÷ 75,734 = 1,319 + 31,158
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,734 ÷ 31,158 = 2 + 13,418
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
31,158 ÷ 13,418 = 2 + 4,322
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,418 ÷ 4,322 = 3 + 452
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,322 ÷ 452 = 9 + 254
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
452 ÷ 254 = 1 + 198
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
254 ÷ 198 = 1 + 56
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
198 ÷ 56 = 3 + 30
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
56 ÷ 30 = 1 + 26
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
30 ÷ 26 = 1 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
26 ÷ 4 = 6 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,038; 200,000,000,266) = 2
The two numbers have common prime factors