Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,945; 200,000,001,035) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,945 = 32 × 5 × 19 × 116,959
99,999,945 is not a prime number but a composite one.
200,000,001,035 = 5 × 463 × 6,269 × 13,781
200,000,001,035 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,001,035 ÷ 99,999,945 = 2,000 + 111,035
Step 2. Divide the smaller number by the above operation's remainder:
99,999,945 ÷ 111,035 = 900 + 68,445
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
111,035 ÷ 68,445 = 1 + 42,590
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
68,445 ÷ 42,590 = 1 + 25,855
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
42,590 ÷ 25,855 = 1 + 16,735
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
25,855 ÷ 16,735 = 1 + 9,120
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
16,735 ÷ 9,120 = 1 + 7,615
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,120 ÷ 7,615 = 1 + 1,505
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,615 ÷ 1,505 = 5 + 90
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,505 ÷ 90 = 16 + 65
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
90 ÷ 65 = 1 + 25
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
65 ÷ 25 = 2 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
25 ÷ 15 = 1 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 10 = 1 + 5
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 5 = 2 + 0
At this step, the remainder is zero, so we stop:
5 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,945; 200,000,001,035) = 5
The two numbers have common prime factors