What is the Greatest Common Factor of 53968 and 53979?

Greatest common factor (GCF) of 53968 and 53979 is 1.

GCF(53968,53979) = 1

We will now calculate the prime factors of 53968 and 53979, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 53968 and 53979.

How to find the GCF of 53968 and 53979?

We will first find the prime factorization of 53968 and 53979. After we will calculate the factors of 53968 and 53979 and find the biggest common factor number .

Step-1: Prime Factorization of 53968

Prime factors of 53968 are 2, 3373. Prime factorization of 53968 in exponential form is:

53968 = 2⁴ × 3373¹

Step-2: Prime Factorization of 53979

Prime factors of 53979 are 3, 19, 947. Prime factorization of 53979 in exponential form is:

53979 = 3¹ × 19¹ × 947¹

Step-3: Factors of 53968

List of positive integer factors of 53968 that divides 53968 without a remainder.

1, 2, 4, 8, 16, 3373, 6746, 13492, 26984

Step-4: Factors of 53979

List of positive integer factors of 53979 that divides 53968 without a remainder.

1, 3, 19, 57, 947, 2841, 17993

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 53968 and 53979. The biggest common factor number is the GCF number.
So the greatest common factor 53968 and 53979 is 1.

Also check out the Least Common Multiple of 53968 and 53979