Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (41,989,382; 6,718,265,452) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
41,989,382 = 2 × 20,994,691
41,989,382 is not a prime number but a composite one.
6,718,265,452 = 22 × 1,679,566,363
6,718,265,452 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:
6,718,265,452 ÷ 41,989,382 = 159 + 41,953,714
Step 2. Divide the smaller number by the above operation's remainder:
41,989,382 ÷ 41,953,714 = 1 + 35,668
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
41,953,714 ÷ 35,668 = 1,176 + 8,146
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
35,668 ÷ 8,146 = 4 + 3,084
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
8,146 ÷ 3,084 = 2 + 1,978
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,084 ÷ 1,978 = 1 + 1,106
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,978 ÷ 1,106 = 1 + 872
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,106 ÷ 872 = 1 + 234
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
872 ÷ 234 = 3 + 170
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
234 ÷ 170 = 1 + 64
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
170 ÷ 64 = 2 + 42
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
64 ÷ 42 = 1 + 22
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
42 ÷ 22 = 1 + 20
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
22 ÷ 20 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
20 ÷ 2 = 10 + 0
At this step, the remainder is zero, so we stop:
2 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 (41,989,382; 6,718,265,452) = 2
The two numbers have common prime factors