What is the Greatest Common Factor of 69465 and 69476?

Greatest common factor (GCF) of 69465 and 69476 is 11.

GCF(69465,69476) = 11

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

How to find the GCF of 69465 and 69476?

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

Step-1: Prime Factorization of 69465

Prime factors of 69465 are 3, 5, 11, 421. Prime factorization of 69465 in exponential form is:

69465 = 3¹ × 5¹ × 11¹ × 421¹

Step-2: Prime Factorization of 69476

Prime factors of 69476 are 2, 11, 1579. Prime factorization of 69476 in exponential form is:

69476 = 2² × 11¹ × 1579¹

Step-3: Factors of 69465

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

1, 3, 5, 11, 15, 33, 55, 165, 421, 1263, 2105, 4631, 6315, 13893, 23155

Step-4: Factors of 69476

List of positive integer factors of 69476 that divides 69465 without a remainder.

1, 2, 4, 11, 22, 44, 1579, 3158, 6316, 17369, 34738

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 69465 and 69476. The biggest common factor number is the GCF number.
So the greatest common factor 69465 and 69476 is 11.

Also check out the Least Common Multiple of 69465 and 69476