Fibonacci Number Checker
MiniWebtool’s Fibonacci Number Checker tests whether a positive integer belongs to the sequence using a perfect-square criterion. Results add its sequence position when applicable and a Zeckendorf representation for exploring its relation to Fibonacci numbers.
For Gemini, paste the copied question into the chat. You can also copy it below.Need help using this tool? Ask AI
View the question
Enter a whole number below to see whether it is a Fibonacci number, with its position in the sequence.
About Fibonacci Number Checker
Welcome to the Fibonacci Number Checker — an instant, mathematically rigorous way to determine whether any positive integer belongs to the Fibonacci sequence. Instead of generating the sequence term by term, the tool applies Gessel's perfect-square theorem for an O(1) verdict, then enriches the answer with the exact index \(F_n\), the unique Zeckendorf representation, a golden-ratio convergence check, and a drawn Fibonacci spiral.
At a Glance
The Fibonacci Number Checker tests whether a number belongs to the Fibonacci sequence using Gessel's perfect-square test. It also shows the number's sequence position and its Zeckendorf representation.
| Feature | What you get | Good for |
|---|---|---|
| Gessel's test | A number n is Fibonacci when 5n^2 + 4 or 5n^2 - 4 is a perfect square. Both results are shown, with a step-by-step proof. | Checking a number without listing the sequence |
| Large inputs | Accepts whole numbers up to 10^30 (30 digits) and uses exact integer arithmetic. | Testing very large numbers |
| Sequence index | For a Fibonacci number the verdict shows its index F(n), for example 144 = F(12). A highlighted strip shows where it sits in the sequence. | Finding which term of the sequence a number is |
| Zeckendorf form | Writes the number as a sum of non-consecutive Fibonacci numbers, such as 100 = 89 + 8 + 3. This works even for numbers that are not Fibonacci. | Number theory coursework and puzzles |
| Golden spiral | Draws a Fibonacci spiral and runs a golden-ratio convergence check on the number. | Visualizing how the sequence relates to the golden ratio |
What Is the Fibonacci Sequence?
The Fibonacci sequence is defined by the simple recurrence relation:
The first twenty terms are: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181. The sequence grows exponentially — roughly by a factor of the golden ratio \(\varphi = \frac{1+\sqrt{5}}{2} \approx 1.61803\) with each term.
How the Checker Works: Gessel's Theorem
Rather than iteratively building the sequence, this tool uses a stunning 1972 result by Ira Gessel:
So to check whether, say, 144 is Fibonacci, compute \(5 \times 144^2 + 4 = 103{,}684 = 322^2\) — a perfect square. Done. No generation required. The test is constant-time modulo arbitrary-precision square roots, making this checker blazingly fast even on 30-digit inputs.
Binet's Formula: The Closed Form
The same golden ratio also gives a closed-form expression for any Fibonacci number:
Because \(|\psi| < 1\), the term \(\psi^n\) decays rapidly and \(F_n \approx \varphi^n / \sqrt{5}\) rounded to the nearest integer. This is why the ratio \(F_{n+1} / F_n\) converges to \(\varphi\).
Zeckendorf's Theorem
Every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers (excluding \(F_1 = 1\), which would be redundant with \(F_2 = 1\)). This is the Zeckendorf representation and forms the basis of the Fibonacci numeral system:
- 100 = 89 + 8 + 3 = \(F_{11} + F_6 + F_4\)
- 50 = 34 + 13 + 3 = \(F_9 + F_7 + F_4\)
- 1000 = 987 + 13 = \(F_{16} + F_7\)
The tool computes this representation for any positive integer you enter — even if your number isn't Fibonacci itself, you still see its decomposition into Fibonacci atoms.
How to Use This Calculator
- Enter a number: Type any non-negative integer up to \(10^{30}\). The tool uses Python's arbitrary-precision integers, so huge inputs work flawlessly.
- Click Check Fibonacci Number: The Gessel test runs instantly.
- Read the verdict banner: Gold means Fibonacci (with the exact index \(F_n\) displayed); gray means not.
- Explore: Review the two Gessel test results, the highlighted sequence strip, the golden spiral, the Zeckendorf breakdown, and the step-by-step proof.
Interesting Facts About Fibonacci Numbers
- 144 is special: It's the largest Fibonacci number that is also a perfect square. In fact, 144 = \(12^2 = F_{12}\). The only other Fibonacci squares are 0 and 1 (Cohn, 1964).
- Every 3rd Fibonacci is even: \(F_3 = 2, F_6 = 8, F_9 = 34, F_{12} = 144, \ldots\) The parity pattern is strictly periodic: odd, odd, even, odd, odd, even, …
- Fibonacci and \(\gcd\): \(\gcd(F_m, F_n) = F_{\gcd(m,n)}\). This is the strong divisibility property and it connects the sequence to number theory.
- Consecutive Fibonaccis are coprime: \(\gcd(F_n, F_{n+1}) = 1\) for all \(n\).
- Fibonacci in nature: The numbers of petals on many flowers (lily 3, buttercup 5, delphinium 8, daisy 21/34/55/89), the spirals of pinecones, sunflower seed heads, and nautilus shells all exhibit Fibonacci numbers.
- Honeybee ancestry: A male drone bee has 1 parent, 2 grandparents, 3 great-grandparents, 5, 8, 13, … Fibonacci.
- Only 4 Fibonacci triangular numbers: 1, 3, 21, 55 (Luo, 1989).
First 25 Fibonacci Numbers
| Index | Value | Notes |
|---|---|---|
| F₀ | 0 | By convention |
| F₁ | 1 | Seed |
| F₂ | 1 | Seed (same value as F₁) |
| F₃ | 2 | First even Fibonacci |
| F₄ | 3 | Prime |
| F₅ | 5 | Prime |
| F₆ | 8 | = 2³ |
| F₇ | 13 | Prime |
| F₈ | 21 | = 3 × 7 |
| F₉ | 34 | = 2 × 17 |
| F₁₀ | 55 | Triangular number |
| F₁₁ | 89 | Prime |
| F₁₂ | 144 | = 12² (largest square Fibonacci) |
| F₁₃ | 233 | Prime |
| F₁₄ | 377 | = 13 × 29 |
| Index | Value | Notes |
|---|---|---|
| F₁₅ | 610 | = 2 × 5 × 61 |
| F₁₆ | 987 | = 3 × 7 × 47 |
| F₁₇ | 1,597 | Prime |
| F₁₈ | 2,584 | |
| F₁₉ | 4,181 | |
| F₂₀ | 6,765 | Triangular-adjacent |
| F₂₁ | 10,946 | |
| F₂₂ | 17,711 | |
| F₂₃ | 28,657 | Prime |
| F₂₄ | 46,368 |
Frequently Asked Questions
Is 0 a Fibonacci number?
Yes. By the standard convention used here, \(F_0 = 0\). Some textbooks start the sequence at \(F_1 = 1, F_2 = 1\), omitting zero, but the OEIS and most modern references include 0 as the zeroth Fibonacci number.
Is 1 a Fibonacci number?
Yes. In fact 1 appears twice: \(F_1 = F_2 = 1\). The tool reports the lower index (1) by convention.
Is 100 a Fibonacci number?
No. \(5 \times 100^2 + 4 = 50{,}004\) and \(5 \times 100^2 - 4 = 49{,}996\); neither is a perfect square, so 100 fails Gessel's test. 100 lies between \(F_{11} = 89\) and \(F_{12} = 144\).
Is 144 a Fibonacci number?
Yes — and famously so. 144 = \(F_{12}\), and it's the only Fibonacci number greater than 1 that is also a perfect square (\(144 = 12^2\)). Gessel's test: \(5 \times 144^2 + 4 = 103{,}684 = 322^2\). ✓
What's the largest Fibonacci number ever calculated?
Fibonacci numbers with over a million digits have been computed. The index of the largest known prime Fibonacci number changes over time; as of 2026, it's \(F_{201107}\) with more than 42,000 digits, found through ongoing collaborative prime search.
Can I enter huge numbers?
Yes, up to \(10^{30}\). The tool relies on Python's big-integer arithmetic and integer square root (isqrt), which stays exact and fast even for inputs with dozens of digits.
Additional Resources
Reference this content, page, or tool as:
"Fibonacci Number Checker" at https://MiniWebtool.com/fibonacci-number-checker/ from MiniWebtool, https://MiniWebtool.com/
by miniwebtool team. Updated: Apr 19, 2026
Chat with your favorite AI
For Gemini, paste the copied question into the chat. You can also copy it below.
View the question
Basic Math Operations:
- Absolute Value Calculator New
- Amicable Number Checker New
- Carry and Borrow Visualizer New
- Ceiling and Floor Function Calculator New
- Common Factor Calculator
- Cross Multiplication Calculator New
- Cube and Cube Root Calculator
- Cube Root Calculator
- Digital Root Calculator New
- Divide Into Two Parts
- Divisibility Test Calculator
- Egyptian Multiplication Calculator New
- Estimation Calculator Popular
- Even or Odd Number Checker New
- Factor Calculator
- Fibonacci Number Checker New
- Find Minimum and Maximum
- First n Digits of e Popular
- First n Digits of Pi Popular
- Goldbach Conjecture Verifier New
- Greatest Common Factor Calculator
- Is it a Prime Number?
- Least Common Multiple Calculator
- Long Addition and Subtraction Calculator New
- Long Division Calculator New
- Long Multiplication Calculator New
- Möbius Function Calculator New
- Mental Math Trainer New
- Mersenne Prime Checker New
- Modulo Calculator Popular
- Multiplication Calculator Popular
- Multiplication Table Generator New
- n-th Root Calculator
- Number Bonds Generator New
- Number of Digits Calculator Popular
- Number Pattern Finder Popular
- Order of Operations Calculator (PEMDAS) Popular
- Perfect Number Checker Popular
- Place Value Chart Generator New
- Prime Factor Calculator
- Prime Factorization Calculator
- Quotient and Remainder Calculator Popular
- Random Math Problem Generator Popular
- Ratio Calculator New
- Roman Numeral Math Solver New
- Russian Peasant Multiplication New
- Skip Counting Generator New
- Soroban Abacus Simulator New
- Sort Numbers Popular
- Square Root (√) Calculator Popular
- Sum Calculator Popular
- Times Tables Quiz New
- Unit Rate Calculator New
- Vedic Math Tricks Calculator New