Integers
Number & Numeral System Calculator
Analyze integers, calculate GCD and LCM, convert bases, and work with Roman numerals.
Analyze number
A prime is an integer greater than 1 with exactly two positive divisors. Factorization searches efficiently up to the square root and is limited to |n| ≤ 10¹². Base conversion, GCD, LCM and arithmetic use BigInt. Roman numerals must be canonical and between 1 and 3999.
Result
Prime
No
Number & Numeral System Calculator
A prime is an integer greater than 1 with exactly two positive divisors. Factorization searches efficiently up to the square root and is limited to |n| ≤ 10¹². Base conversion, GCD, LCM and arithmetic use BigInt. Roman numerals must be canonical and between 1 and 3999.
FAQ
Are 1 or 0 prime?
No. A prime is greater than 1.
How do GCD and LCM work?
GCD uses Euclid's algorithm; LCM derives from it with division before multiplication.
Can I use other bases?
Yes, every base from 2 to 36 using digits 0–9 and A–Z.
Why is IIII rejected?
Only canonical notation is accepted; 4 is IV.
Related tools
Scientific Calculator
Evaluate free expressions with scientific functions.
Fraction calculator
Calculate and simplify fractions and mixed numbers exactly.
Statistics Calculator
Analyze measures, correlation and regression.