Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,023; 200,000,000,736) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,023 = 3 × 2,293 × 14,537
100,000,023 is not a prime number but a composite one.
200,000,000,736 = 25 × 32 × 694,444,447
200,000,000,736 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,736 ÷ 100,000,023 = 1,999 + 99,954,759
Step 2. Divide the smaller number by the above operation's remainder:
100,000,023 ÷ 99,954,759 = 1 + 45,264
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,954,759 ÷ 45,264 = 2,208 + 11,847
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
45,264 ÷ 11,847 = 3 + 9,723
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
11,847 ÷ 9,723 = 1 + 2,124
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,723 ÷ 2,124 = 4 + 1,227
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,124 ÷ 1,227 = 1 + 897
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,227 ÷ 897 = 1 + 330
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
897 ÷ 330 = 2 + 237
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
330 ÷ 237 = 1 + 93
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
237 ÷ 93 = 2 + 51
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
93 ÷ 51 = 1 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
51 ÷ 42 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 9 = 4 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 6 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 3 = 2 + 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,023; 200,000,000,736) = 3
The two numbers have common prime factors