Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,059; 200,000,000,463) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,059 = 3 × 19 × 1,754,387
100,000,059 is not a prime number but a composite one.
200,000,000,463 = 3 × 9,109 × 7,318,769
200,000,000,463 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,463 ÷ 100,000,059 = 1,999 + 99,882,522
Step 2. Divide the smaller number by the above operation's remainder:
100,000,059 ÷ 99,882,522 = 1 + 117,537
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,882,522 ÷ 117,537 = 849 + 93,609
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
117,537 ÷ 93,609 = 1 + 23,928
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
93,609 ÷ 23,928 = 3 + 21,825
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,928 ÷ 21,825 = 1 + 2,103
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,825 ÷ 2,103 = 10 + 795
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,103 ÷ 795 = 2 + 513
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
795 ÷ 513 = 1 + 282
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
513 ÷ 282 = 1 + 231
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
282 ÷ 231 = 1 + 51
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
231 ÷ 51 = 4 + 27
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
51 ÷ 27 = 1 + 24
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
27 ÷ 24 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
24 ÷ 3 = 8 + 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,059; 200,000,000,463) = 3
The two numbers have common prime factors