Add, subtract, multiply, and divide large integers or exact decimals. View the full integer answer or reduced fraction, with rounded displays labelled separately.
Enter your numbers, choose an operation, and calculate. Supported input types depend on the operation; large calculations may take longer and can be cancelled.
Worked example: enter 12345678901234567890, choose Add, enter 98765432109876543210 and calculate. The result is 111111111011111111100, a 21-digit sum.
Input notes: put a minus sign in front of negative numbers, such as -500. Commas, spaces and underscores are ignored, so 1,000,000 is read as one million. Leading zeros are allowed. You can also type decimals (3.14159), scientific notation (3.5e19, 6.022E23) and hexadecimal (0xFF), binary (0b1011) or octal (0o17). Decimals are stored as exact fractions, so 0.1 + 0.2 gives exactly 0.3.
Digits are added exactly, carrying across every place, within the input and workload limits. For example, 999999999999999999 + 1 = 1000000000000000000.
Useful for totalling large counts, checking ledger sums or verifying programming results.
Subtraction handles signs automatically, so a larger second number simply produces a negative result. 1000000000000000000 − 1 = 999999999999999999, and 5 − 12 = −7.
Handy for finding exact differences between big identifiers, timestamps or balances.
This calculator retains the full integer product: 999999999999999999 × 999999999999999999 = 999999999999999998000000000000000001.
Use exact products to check integer arithmetic and combinatorial calculations.
For whole-number inputs, division returns the integer quotient (rounded toward zero), the remainder, and the reduced fraction. A decimal view is also available, clearly marked as rounded to your chosen number of places. For 100000000000000000000 ÷ 7 the quotient is 14285714285714285714 with remainder 2.
Use it to split large quantities or confirm divisibility.
Raise an integer or decimal base to a non-negative whole-number power, such as 2^100 = 1267650600228229401496703205376. To keep your browser responsive, results estimated to exceed two million digits are refused with an explanation.
Useful for growth calculations, binary sizes and number-theory exercises.
Modulo gives the remainder after division. 123456789012345678901234567890 mod 97 = 52. With negative numbers the remainder takes the sign of the first number (truncated division), so −7 mod 3 = −1.
Common in checksums, hashing and clock-style arithmetic.
The factorial n! multiplies every whole number from 1 to n. 25! = 15511210043330985984000000, and by definition 0! = 1. Negative inputs are rejected, and n is capped at 50,000 as a workload safeguard. Calculation time depends on the input and device.
Factorials appear whenever you count arrangements or permutations.
For nonzero inputs, the GCD is the largest positive integer dividing both values, and the LCM is their smallest positive common multiple. Signs are ignored; this calculator returns GCD(0, 0) = 0 and LCM(a, 0) = 0. gcd(1071, 462) = 21 and lcm(4, 6) = 12.
Use GCD to simplify fractions and LCM to find common denominators or repeating cycles.
Square multiplies a number by itself: 123456789² = 15241578750190521. Square root returns the exact integer square root (rounded down): ⌊√10^40⌋ = 10^20, and ⌊√99⌋ = 9.
Useful for geometry, perfect-square checks and number theory.
Bitwise operations work on the binary form of whole numbers within the input and workload limits. 0xFF AND 0x0F = 15, 12 OR 3 = 15, 12 XOR 10 = 6, 1 << 100 = 2^100 and 1024 >> 3 = 128. Negative numbers follow unbounded two's-complement rules, rather than a fixed-width mask.
Use these operations to inspect masks, flags, and integer bit patterns. Switch the result to Hex or Binary view to see the bits.
Enter values like 3.5e19 or 0.000125. Add, subtract, multiply, divide, power and square keep decimals exact using fractions, then show the exact decimal, or a rounded decimal to your chosen precision when it repeats forever (like 1 ÷ 3).
No floating-point rounding: 0.1 + 0.2 = 0.3 exactly.
nCr counts ways to choose r items from n when order doesn't matter; nPr counts ordered arrangements. C(52, 5) = 2598960 poker hands, and P(10, 3) = 720.
These formulas count selections of distinct items without replacement.
Two 20-digit numbers produce a 21-digit sum.
Subtracting one from a power of ten produces a string of nines.
The complete 36-digit product is retained.
Quotient shown; remainder and fraction appear in the result.
The number of values in a 64-bit unsigned integer.
Ways to arrange 25 distinct items in a row.
A big number calculator performs arithmetic on large integers without converting them to floating-point values. This tool also supports exact decimal input through fractions. Rounded display formats are labelled separately from exact results.
JavaScript’s Number type uses double-precision floating point. Its safe integer range ends at 9,007,199,254,740,991, known as Number.MAX_SAFE_INTEGER. Larger integers are not all distinguishable: converting 9,007,199,254,740,993 to a Number produces 9,007,199,254,740,992.
Arbitrary-precision integers avoid this by storing a number as a variable-length sequence of digits (or machine words) that grows as needed. This calculator uses JavaScript's built-in BigInt, which performs addition, multiplication, division and powers exactly on those sequences. Fractions are kept as an exact numerator and denominator, reduced with the greatest common divisor.
BigInt avoids the fixed safe-integer range of Number, but calculations still require memory and time. This tool runs arithmetic in a background worker, supports cancellation, and applies input-size and operation-specific workload safeguards.
The result-word selector offers 19 languages. English uses short-scale names; other languages use their own number conventions. When a supported name is unavailable, words are read digit by digit and clearly labelled. Here are common English names:
| Power of 10 | Name |
|---|---|
| 103 | Thousand |
| 106 | Million |
| 109 | Billion |
| 1012 | Trillion |
| 1015 | Quadrillion |
| 1018 | Quintillion |
| 1021 | Sextillion |
| 1024 | Septillion |
| 1027 | Octillion |
| 1030 | Nonillion |
| 1033 | Decillion |
| 1036 | Undecillion |
| 1063 | Vigintillion |
| 10100 | Googol |
| 10303 | Centillion |
Students checking homework, programmers testing integer overflow, cryptography learners working with large primes, and anyone counting combinations or probabilities can all benefit from exact large-number arithmetic.
It performs exact arithmetic on large integers and supports decimals through exact fractions. Integer answers retain their digits, while rounded decimal and scientific displays are labelled.
Integer results are exact. Addition, subtraction, multiplication, powers, modulo, factorial, GCD, LCM, quotients, remainders and fractions are computed with exact integer arithmetic. Only the optional decimal and scientific views are rounded, and they are clearly labelled as such.
Yes. You can paste numbers with thousands or tens of thousands of digits. Each box shows a live digit count, and long results are shown as a preview that you can expand, copy or download in full.
Decimal input is limited to 200,000 significant digits, with scientific-notation expansion checked against the input limit. Other formats and operations have additional size or workload checks. The result-size safeguard uses a two-million-digit threshold, and factorial input is limited to 50,000. Runtime and memory use depend on your device.
Yes. Multiplication is exact for any inputs within the limits above. For example, 999999999999999999 × 999999999999999999 returns all 36 digits of the product.
Yes. Division shows the integer quotient, the remainder and the exact reduced fraction. You can also view a decimal value rounded to between 5 and 500 places. Dividing by zero shows a helpful error instead of a result.
Yes. Add a minus sign before a number. Quotients are rounded toward zero, and remainders and modulo results take the sign of the first number, so −7 mod 3 is −1. GCD and LCM always return non-negative values.
Yes. Powers require a non-negative whole-number exponent and must pass exponent and estimated-size checks. Factorials work for whole numbers from 0 to 50,000. Long jobs run in the background and can be cancelled.
Yes. Choose from 19 languages in the result-word selector and copy the displayed words. English uses the short scale, for example 1000000000000 is one trillion. Word output is limited to 3,003 integer digits. Supported names vary by language; when a name is unavailable, exact digits are read individually and clearly labelled. Fractional words show the first 100 decimal places.
Yes. Square root returns the exact integer square root rounded down, and the nCr and nPr buttons compute combinations and permutations exactly, such as C(52, 5) = 2,598,960.
Yes. Type decimals like 3.14, scientific notation like 3.5e19, or hexadecimal like 0xFF (binary 0b and octal 0o also work). Decimals are kept as exact fractions, so 0.1 + 0.2 is exactly 0.3.
Yes. AND, OR, XOR, shift left (<<) and shift right (>>) work on whole numbers within the input and workload limits, including hex input. Negative numbers follow two's-complement rules.
Arithmetic runs in your browser; the calculator does not submit inputs or results to a calculation service. History is kept in memory unless you choose to save it on this device. Website analytics and hosting requests are separate from calculation processing; see the Privacy Policy.
Yes. It is completely free to use, with no sign-up, account or download required.
It is 1 followed by 33 zeros, which is 10^33, called one decillion in the short scale used in modern English.
Undecillion (10^36) comes after decillion (10^33), followed by duodecillion (10^39) and tredecillion (10^42).
Quindecillion (10^48) comes after quattuordecillion (10^45), followed by sexdecillion (10^51).
Million, billion, trillion, quadrillion, quintillion, sextillion, septillion, octillion, nonillion and decillion, each 1,000 times the previous name. The table above and the names guide continue the list to vigintillion.
There is no fixed threshold. A number is large relative to a context, such as the digits a calculator can store. Numbers such as 2 or 7 are bigger than 1 but small compared with 100, so size always depends on the comparison.
Positive numbers beat negative ones. Between positive whole numbers, more digits means bigger; with equal digit counts, compare digits from left to right. For very long numbers, subtract them here: a positive difference means the first is bigger.
There is no largest number, because adding one to any number gives a bigger one. A commonly quoted estimate for atoms in the observable universe is around 10^80, which is still smaller than a googol (10^100).
Yes. The default view shows every digit of an integer result. Scientific notation appears only if you choose it, and the comma option groups digits in threes for easier reading.
Yes. Use your browser zoom (Ctrl and + on Windows, Command and + on a Mac, or pinch on a phone). The layout adapts, and dark mode can reduce glare.
Add large integers and exact decimals without floating-point rounding. See every digit of the sum and copy the result in words.
Subtract huge numbers exactly, including negative and decimal values. Find precise differences and inspect every digit.
Multiply very large integers and exact decimals. View the full integer product or exact fraction without floating-point conversion.
Divide large numbers with exact quotients, remainders, and reduced fractions. Inspect rounded decimals separately.
Calculate exact large powers with whole-number exponents, including decimal bases and scientific-notation inputs.
Compute exact factorials from 0 to 50,000. View full integer results, digit counts, and downloadable text.
Find the exact GCD of two large integers. Simplify ratios and test common factors without rounding.
Calculate the exact LCM of large whole numbers. Find common multiples and repeating cycle lengths.
Find the exact integer square root of a large non-negative whole number, rounded down without floating-point errors.
Calculate exact nCr combinations for large whole numbers. Count selections where order does not matter.
Compute exact nPr permutations. Count ordered selections from distinct items without replacement.
Calculate bitwise AND, OR, XOR, and shifts on large integers. Enter hexadecimal, binary, octal, or decimal values.
Add, subtract, multiply, and divide decimals using exact fractions. Avoid floating-point errors such as 0.1 + 0.2.
Calculate with scientific-notation input such as 3.5e19. Parse large and tiny decimal values exactly as written, without floating-point conversion.