Step 1 :
Divide $ 16470 $ by $ 11470 $ and get the remainder

$$ 16470 : 11470 = 1 \text{ ( remainder is } \color{blue}{ 5000 } \text{ ) } $$

The remainder is positive ($ 5000 > 0 $), so we will continue with division.

Step 2 :
Divide $ 11470 $ by $ \color{blue}{ 5000 } $ and get the remainder

$$ 11470 : 5000 = 2 \text{ ( remainder is } \color{blue}{ 1470 } \text{ ) } $$

The remainder is still positive ($ 1470 > 0 $), so we will continue with division.

Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 1470 } $ and get the remainder

$$ 5000 : 1470 = 3 \text{ ( remainder is } \color{blue}{ 590 } \text{ ) } $$

The remainder is still positive ($ 590 > 0 $), so we will continue with division.

Step 4 :
Divide $ 1470 $ by $ \color{blue}{ 590 } $ and get the remainder

$$ 1470 : 590 = 2 \text{ ( remainder is } \color{blue}{ 290 } \text{ ) } $$

The remainder is still positive ($ 290 > 0 $), so we will continue with division.

Step 5 :
Divide $ 590 $ by $ \color{blue}{ 290 } $ and get the remainder

$$ 590 : 290 = 2 \text{ ( remainder is } \color{blue}{ 10 } \text{ ) } $$

The remainder is still positive ($ 10 > 0 $), so we will continue with division.

Step 6 :
Divide $ 290 $ by $ \color{blue}{ 10 } $ and get the remainder

$$ 290 : \color{blue}{ \boxed { 10 }} = 29 \text{ ( remainder is } \color{blue}{ 0 } \text{ ) } $$

The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 10 }} $.

This solution can be visualized using a Venn diagram.

The GCD equals the product of the numbers at the intersection.

GCD Calculator