Step 1 :
Divide $ 23241052 $ by $ 101 $ and get the remainder

$$ 23241052 : 101 = 230109 \text{ ( remainder is } \color{blue}{ 43 } \text{ ) } $$

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

Step 2 :
Divide $ 101 $ by $ \color{blue}{ 43 } $ and get the remainder

$$ 101 : 43 = 2 \text{ ( remainder is } \color{blue}{ 15 } \text{ ) } $$

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

Step 3 :
Divide $ 43 $ by $ \color{blue}{ 15 } $ and get the remainder

$$ 43 : 15 = 2 \text{ ( remainder is } \color{blue}{ 13 } \text{ ) } $$

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

Step 4 :
Divide $ 15 $ by $ \color{blue}{ 13 } $ and get the remainder

$$ 15 : 13 = 1 \text{ ( remainder is } \color{blue}{ 2 } \text{ ) } $$

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

Step 5 :
Divide $ 13 $ by $ \color{blue}{ 2 } $ and get the remainder

$$ 13 : 2 = 6 \text{ ( remainder is } \color{blue}{ 1 } \text{ ) } $$

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

Step 6 :
Divide $ 2 $ by $ \color{blue}{ 1 } $ and get the remainder

$$ 2 : \color{blue}{ \boxed { 1 }} = 2 \text{ ( remainder is } \color{blue}{ 0 } \text{ ) } $$

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

This solution can be visualized using a Venn diagram.

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

GCD Calculator