Prime checker, Fibonacci, factorization, GCD/LCM, Roman numerals, and base converter.
Three steps. Instant results.
This toolkit bundles 6 number utilities: Prime Checker uses trial division up to โn. Fibonacci generates sequences iteratively. Factorize uses trial division to find prime factors. GCD uses the Euclidean algorithm, and LCM = |aรb|/GCD. Roman numerals convert both ways using value mapping. Base converter uses standard radix string parsing for bases 2, 8, 10, 16.