What is the Greatest Common Factor of 53968 and 53973?

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

GCF(53968,53973) = 1

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

How to find the GCF of 53968 and 53973?

We will first find the prime factorization of 53968 and 53973. After we will calculate the factors of 53968 and 53973 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 53973

Prime factors of 53973 are 3, 1999. Prime factorization of 53973 in exponential form is:

53973 = 3³ × 1999¹

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 53973

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

1, 3, 9, 27, 1999, 5997, 17991

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 53968 and 53973