What is the Greatest Common Factor of 69467 and 69480?

Greatest common factor (GCF) of 69467 and 69480 is 1.

GCF(69467,69480) = 1

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

How to find the GCF of 69467 and 69480?

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

Step-1: Prime Factorization of 69467

Prime factors of 69467 are 69467. Prime factorization of 69467 in exponential form is:

69467 = 69467¹

Step-2: Prime Factorization of 69480

Prime factors of 69480 are 2, 3, 5, 193. Prime factorization of 69480 in exponential form is:

69480 = 2³ × 3² × 5¹ × 193¹

Step-3: Factors of 69467

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

Step-4: Factors of 69480

List of positive integer factors of 69480 that divides 69467 without a remainder.

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36, 40, 45, 60, 72, 90, 120, 180, 193, 360, 386, 579, 772, 965, 1158, 1544, 1737, 1930, 2316, 2895, 3474, 3860, 4632, 5790, 6948, 7720, 8685, 11580, 13896, 17370, 23160, 34740

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 69467 and 69480