What is the Greatest Common Factor of 8047 and 8064?

Greatest common factor (GCF) of 8047 and 8064 is 1.

GCF(8047,8064) = 1

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

How to find the GCF of 8047 and 8064?

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

Step-1: Prime Factorization of 8047

Prime factors of 8047 are 13, 619. Prime factorization of 8047 in exponential form is:

8047 = 13¹ × 619¹

Step-2: Prime Factorization of 8064

Prime factors of 8064 are 2, 3, 7. Prime factorization of 8064 in exponential form is:

8064 = 2⁷ × 3² × 7¹

Step-3: Factors of 8047

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

1, 13, 619

Step-4: Factors of 8064

List of positive integer factors of 8064 that divides 8047 without a remainder.

1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 16, 18, 21, 24, 28, 32, 36, 42, 48, 56, 63, 64, 72, 84, 96, 112, 126, 128, 144, 168, 192, 224, 252, 288, 336, 384, 448, 504, 576, 672, 896, 1008, 1152, 1344, 2016, 2688, 4032

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 8047 and 8064