Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,083; 200,000,000,592) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,083 = 3 × 227 × 146,843
100,000,083 is not a prime number but a composite one.
200,000,000,592 = 24 × 32 × 7 × 229 × 866,431
200,000,000,592 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,592 ÷ 100,000,083 = 1,999 + 99,834,675
Step 2. Divide the smaller number by the above operation's remainder:
100,000,083 ÷ 99,834,675 = 1 + 165,408
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,834,675 ÷ 165,408 = 603 + 93,651
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
165,408 ÷ 93,651 = 1 + 71,757
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
93,651 ÷ 71,757 = 1 + 21,894
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
71,757 ÷ 21,894 = 3 + 6,075
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,894 ÷ 6,075 = 3 + 3,669
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,075 ÷ 3,669 = 1 + 2,406
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,669 ÷ 2,406 = 1 + 1,263
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,406 ÷ 1,263 = 1 + 1,143
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,263 ÷ 1,143 = 1 + 120
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,143 ÷ 120 = 9 + 63
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
120 ÷ 63 = 1 + 57
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
63 ÷ 57 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
57 ÷ 6 = 9 + 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,083; 200,000,000,592) = 3
The two numbers have common prime factors