Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,944; 200,000,000,920) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,944 = 23 × 11 × 1,136,363
99,999,944 is not a prime number but a composite one.
200,000,000,920 = 23 × 5 × 73 × 68,493,151
200,000,000,920 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,920 ÷ 99,999,944 = 2,000 + 112,920
Step 2. Divide the smaller number by the above operation's remainder:
99,999,944 ÷ 112,920 = 885 + 65,744
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
112,920 ÷ 65,744 = 1 + 47,176
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
65,744 ÷ 47,176 = 1 + 18,568
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
47,176 ÷ 18,568 = 2 + 10,040
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
18,568 ÷ 10,040 = 1 + 8,528
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,040 ÷ 8,528 = 1 + 1,512
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,528 ÷ 1,512 = 5 + 968
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,512 ÷ 968 = 1 + 544
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
968 ÷ 544 = 1 + 424
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
544 ÷ 424 = 1 + 120
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
424 ÷ 120 = 3 + 64
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
120 ÷ 64 = 1 + 56
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
64 ÷ 56 = 1 + 8
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
56 ÷ 8 = 7 + 0
At this step, the remainder is zero, so we stop:
8 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 (99,999,944; 200,000,000,920) = 8 = 23
The two numbers have common prime factors