Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (143,221,478,301; 91,307,341,293) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
143,221,478,301 = 32 × 112 × 131,516,509
143,221,478,301 is not a prime number but a composite one.
91,307,341,293 = 3 × 7 × 2,053 × 2,117,861
91,307,341,293 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:
143,221,478,301 ÷ 91,307,341,293 = 1 + 51,914,137,008
Step 2. Divide the smaller number by the above operation's remainder:
91,307,341,293 ÷ 51,914,137,008 = 1 + 39,393,204,285
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
51,914,137,008 ÷ 39,393,204,285 = 1 + 12,520,932,723
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
39,393,204,285 ÷ 12,520,932,723 = 3 + 1,830,406,116
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
12,520,932,723 ÷ 1,830,406,116 = 6 + 1,538,496,027
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,830,406,116 ÷ 1,538,496,027 = 1 + 291,910,089
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,538,496,027 ÷ 291,910,089 = 5 + 78,945,582
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
291,910,089 ÷ 78,945,582 = 3 + 55,073,343
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
78,945,582 ÷ 55,073,343 = 1 + 23,872,239
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
55,073,343 ÷ 23,872,239 = 2 + 7,328,865
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
23,872,239 ÷ 7,328,865 = 3 + 1,885,644
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
7,328,865 ÷ 1,885,644 = 3 + 1,671,933
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
1,885,644 ÷ 1,671,933 = 1 + 213,711
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
1,671,933 ÷ 213,711 = 7 + 175,956
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
213,711 ÷ 175,956 = 1 + 37,755
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
175,956 ÷ 37,755 = 4 + 24,936
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
37,755 ÷ 24,936 = 1 + 12,819
Step 18. Divide the remainder of the step 16 by the remainder of the step 17:
24,936 ÷ 12,819 = 1 + 12,117
Step 19. Divide the remainder of the step 17 by the remainder of the step 18:
12,819 ÷ 12,117 = 1 + 702
Step 20. Divide the remainder of the step 18 by the remainder of the step 19:
12,117 ÷ 702 = 17 + 183
Step 21. Divide the remainder of the step 19 by the remainder of the step 20:
702 ÷ 183 = 3 + 153
Step 22. Divide the remainder of the step 20 by the remainder of the step 21:
183 ÷ 153 = 1 + 30
Step 23. Divide the remainder of the step 21 by the remainder of the step 22:
153 ÷ 30 = 5 + 3
Step 24. Divide the remainder of the step 22 by the remainder of the step 23:
30 ÷ 3 = 10 + 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 (143,221,478,301; 91,307,341,293) = 3
The two numbers have common prime factors