1649649:6936393639373=

Treating it as a ratio 1649649 : 6936393639373, you want gcd(1649649, 6936393639373).

• 6936393639373 mod 1649649 = 663292
• gcd(1649649, 663292) → and continuing with Euclid’s algorithm yields gcd = 1

Therefore, the ratio is already in lowest terms.

Answer: 1649649:6936393639373 (gcd = 1)

If you want the decimal value of the ratio, it’s approximately 2.38 × 10^-7.