Big Integer Calculator

Big Integer Calculator

Compute exact results for math expressions that overflow ordinary calculators. The tool runs entirely on JavaScript BigInt, so factorial(1000), 2⁵⁰⁰⁰, fibonacci(10000), and primality checks on trillion-digit candidates return every digit correctly — no scientific notation, no silent rounding.

Nutzung

1. Type an integer expression, for example 2 ** 1000, factorial(100), oder gcd(1071, 462).
2. Pick an output base (decimal, hex, binary, octal). The result updates as you type.
3. Use Copy or Download to grab the full result — useful when the number runs to thousands of digits.
4. Read the digit count under the result to compare growth rates of different expressions.

Funktionen

• Operators – +, -, *, / (integer truncation), % (mod), ** oder ^ (power), and postfix ! for factorial.
• Built-in functions – factorial, fibonacci / fib (fast-doubling), gcd, lcm, isprime (deterministic Miller-Rabin), nextprime, abs, pow, mod, and integer sqrt.
• Number literals – decimal, 0x hex, 0b binary, 0o octal, plus _ separators for readability such as 1_000_000.
• Output bases – render the same value in base 10, 16, 2, or 8 without recomputing.
• Digit counter – instantly reports how many decimal digits the answer has, even when the result spans pages.
• Runs in your browser – nothing is sent to a server, and the parser rejects negative exponents, decimal points, and unbounded exponents that would freeze the page.

Example Inputs

• 100! – 158-digit factorial.
• 2 ** 1000 – the value behind 1000-bit RSA-style key sizes.
• fibonacci(500) – the 500th Fibonacci number, 105 decimal digits.
• nextprime(10 ** 30) – the next prime above an octillion.
• gcd(1071, 462) – the Euclidean algorithm at work.
• isprime(1000000000039) – a 13-digit prime confirmed in milliseconds.