Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,053; 200,000,000,256) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,053 = 32 × 11,111,117
100,000,053 is not a prime number but a composite one.
200,000,000,256 = 28 × 3 × 7 × 5,843 × 6,367
200,000,000,256 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,256 ÷ 100,000,053 = 1,999 + 99,894,309
Step 2. Divide the smaller number by the above operation's remainder:
100,000,053 ÷ 99,894,309 = 1 + 105,744
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,894,309 ÷ 105,744 = 944 + 71,973
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
105,744 ÷ 71,973 = 1 + 33,771
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
71,973 ÷ 33,771 = 2 + 4,431
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
33,771 ÷ 4,431 = 7 + 2,754
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,431 ÷ 2,754 = 1 + 1,677
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,754 ÷ 1,677 = 1 + 1,077
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,677 ÷ 1,077 = 1 + 600
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,077 ÷ 600 = 1 + 477
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
600 ÷ 477 = 1 + 123
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
477 ÷ 123 = 3 + 108
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
123 ÷ 108 = 1 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
108 ÷ 15 = 7 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 3 = 5 + 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,053; 200,000,000,256) = 3
The two numbers have common prime factors