Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,158; 200,000,000,085) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,158 = 2 × 3 × 149 × 111,857
100,000,158 is not a prime number but a composite one.
200,000,000,085 = 3 × 5 × 13,333,333,339
200,000,000,085 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,085 ÷ 100,000,158 = 1,999 + 99,684,243
Step 2. Divide the smaller number by the above operation's remainder:
100,000,158 ÷ 99,684,243 = 1 + 315,915
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,684,243 ÷ 315,915 = 315 + 171,018
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
315,915 ÷ 171,018 = 1 + 144,897
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
171,018 ÷ 144,897 = 1 + 26,121
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
144,897 ÷ 26,121 = 5 + 14,292
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
26,121 ÷ 14,292 = 1 + 11,829
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
14,292 ÷ 11,829 = 1 + 2,463
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
11,829 ÷ 2,463 = 4 + 1,977
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,463 ÷ 1,977 = 1 + 486
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,977 ÷ 486 = 4 + 33
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
486 ÷ 33 = 14 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
33 ÷ 24 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 9 = 2 + 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,158; 200,000,000,085) = 3
The two numbers have common prime factors