Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,032; 200,000,000,978) = ?
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,978 = 2 × 79 × 83 × 15,250,877
200,000,000,978 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,978 ÷ 100,000,032 = 1,999 + 99,937,010
Step 2. Divide the smaller number by the above operation's remainder:
100,000,032 ÷ 99,937,010 = 1 + 63,022
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,937,010 ÷ 63,022 = 1,585 + 47,140
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
63,022 ÷ 47,140 = 1 + 15,882
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
47,140 ÷ 15,882 = 2 + 15,376
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,882 ÷ 15,376 = 1 + 506
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,376 ÷ 506 = 30 + 196
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
506 ÷ 196 = 2 + 114
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
196 ÷ 114 = 1 + 82
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
114 ÷ 82 = 1 + 32
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
82 ÷ 32 = 2 + 18
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
32 ÷ 18 = 1 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
18 ÷ 14 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 4 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,032; 200,000,000,978) = 2
The two numbers have common prime factors