Free tools that run in your browser. Use any tool without an account.

Favourites Cart
Sign in
Join free

Fibonacci Calculator

  • Free
  • Runs in your browser
  • No account needed

Get any Fibonacci term or check membership instantly. For example, F(10) = 55. The tool returns the term, its position, digit count, sum F(0) to F(n), the ratio F(n)/F(n-1), and a shareable link.

Answer
12,586,269,025
Number of digits
11
Sum of F(0) to F(n)
32,951,280,098
Ratio F(n) / F(n - 1)
1.61803398875

Some books start the sequence at F(1) = 1, F(2) = 1; the numbers are the same, only the counting starts differently. n is limited to 50,000.

Runs in your browser. Your files and values are not sent to us. Report a problem
Advertisement

About the Fibonacci Calculator

This free tool computes Fibonacci numbers and checks whether an integer is in the Fibonacci sequence. You enter either a position n or a number to test. Results update as you type and appear instantly, with no calculate button. For large n the tool uses fast doubling and exact big integer arithmetic so results are exact up to the site limit. The page follows the F(0) = 0, F(1) = 1 convention and notes the alternate F(1) = 1 convention to avoid off-by-one errors. The tool runs entirely in your browser and does not upload your inputs or results. You can copy outputs or share a link that reopens the calculator with your numbers. The maximum allowed position is 50,000 to keep interactive performance and browser memory practical. Methods and membership tests follow standard references such as OEIS and algorithm expositions.

How to use it

  1. 1Enter either a position n or a number to check in the input box.
  2. 2Watch the results update instantly as you type; there is no calculate button.
  3. 3Copy the term, digits, sum, or ratio from the results area.
  4. 4Use the share link to reopen the page with the same inputs.
Advertisement

Worked example

Input: n = 10. Output: Answer = 55; Position = 10; Number of digits = 2; Sum F(0) to F(10) = 143; Ratio F(10)/F(9) = 55/34 ≈ 1.6176470588235294.

The formula

Definition: F(0) = 0, F(1) = 1, F(n) = F(n-1) + F(n-2). Fast doubling identities (used for large n with exact big integers): F(2k) = F(k) * (2*F(k+1) - F(k)) F(2k+1) = F(k)^2 + F(k+1)^2 Membership test: an integer x is Fibonacci exactly when 5*x^2 + 4 or 5*x^2 - 4 is a perfect square. Ratio: F(n)/F(n-1) tends to the golden ratio 1.6180339887.... Caveat: some books start at F(1) = 1, F(2) = 1; the numbers match but indices shift

Source: OEIS A000045 (Fibonacci sequence)Fast doubling method explanation (GeeksforGeeks)Binet's formula and Fibonacci overview (MathWorld). Last checked 6 November 2026.

What it is good for

  • Instant, updating results as you type
  • Exact big integer results for large indices
  • Runs completely in your browser; nothing uploaded
  • n is limited to 50,000 to keep browser memory and responsiveness practical
  • Very large Fibonacci numbers produce long text output that can be slow to copy or render
Advertisement

Questions people ask

What inputs can I provide?

You can enter a position n to get F(n) or enter a number to check if it is a Fibonacci number. The tool shows term, position, digits, running sum, and neighbour ratio.

Which index convention does this tool use?

This tool uses F(0) = 0 and F(1) = 1 by default. The page also notes the alternate F(1) = 1 convention so you can avoid off-by-one mistakes.

How does the tool compute large Fibonacci numbers exactly?

For large n the calculator uses the fast doubling identities with big integer arithmetic. That gives an O(log n) method and exact integer results up to the tool limit.

How can I tell if a number is a Fibonacci number?

A number x is Fibonacci exactly when 5*x^2 + 4 or 5*x^2 - 4 is a perfect square. The calculator checks this test and reports membership and neighbour values.

Does the calculator send my data to a server?

No. The computation runs in your browser and nothing is uploaded. You can copy results locally or create a share link that encodes the inputs in the URL.

What if I need F(n) for n larger than 50,000?

The site limit is 50,000 for interactive use. If you need larger values, use a dedicated big integer library or an offline program that can handle more memory and storage.

Help keep every tool free

FreeToolr stays free because people help it grow. Share a tool you like, tell us what to build next, or support us on Ko-fi.

Advertisement
Advertisement