Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,095; 200,000,000,481) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,095 = 3 × 5 × 13 × 512,821
100,000,095 is not a prime number but a composite one.
200,000,000,481 = 3 × 107 × 623,052,961
200,000,000,481 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,481 ÷ 100,000,095 = 1,999 + 99,810,576
Step 2. Divide the smaller number by the above operation's remainder:
100,000,095 ÷ 99,810,576 = 1 + 189,519
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,810,576 ÷ 189,519 = 526 + 123,582
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
189,519 ÷ 123,582 = 1 + 65,937
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
123,582 ÷ 65,937 = 1 + 57,645
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
65,937 ÷ 57,645 = 1 + 8,292
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
57,645 ÷ 8,292 = 6 + 7,893
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,292 ÷ 7,893 = 1 + 399
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,893 ÷ 399 = 19 + 312
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
399 ÷ 312 = 1 + 87
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
312 ÷ 87 = 3 + 51
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
87 ÷ 51 = 1 + 36
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
51 ÷ 36 = 1 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
36 ÷ 15 = 2 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 6 = 2 + 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,095; 200,000,000,481) = 3
The two numbers have common prime factors