Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,032; 200,000,000,493) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,032 = 25 × 3 × 11 × 281 × 337
100,000,032 is not a prime number but a composite one.
200,000,000,493 = 32 × 22,222,222,277
200,000,000,493 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,493 ÷ 100,000,032 = 1,999 + 99,936,525
Step 2. Divide the smaller number by the above operation's remainder:
100,000,032 ÷ 99,936,525 = 1 + 63,507
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,936,525 ÷ 63,507 = 1,573 + 40,014
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
63,507 ÷ 40,014 = 1 + 23,493
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
40,014 ÷ 23,493 = 1 + 16,521
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,493 ÷ 16,521 = 1 + 6,972
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
16,521 ÷ 6,972 = 2 + 2,577
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,972 ÷ 2,577 = 2 + 1,818
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,577 ÷ 1,818 = 1 + 759
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,818 ÷ 759 = 2 + 300
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
759 ÷ 300 = 2 + 159
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
300 ÷ 159 = 1 + 141
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
159 ÷ 141 = 1 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
141 ÷ 18 = 7 + 15
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 15 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
15 ÷ 3 = 5 + 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,032; 200,000,000,493) = 3
The two numbers have common prime factors