Unlike some other types of numbers like prime numbers, calculating large Fibonacci numbers can be done quite easily with even a standard household computer. The process involves only repeated addition (rather than the intense division processes involved with large prime numbers). Beyond that, large Fibonacci numbers do not serve as much purpose as other large numbers (like primes). Because of this, these large numbers are generally left for quick calculation by machine if ever necessary.
An example of a computer program that could calculate the nth Fibonacci number (n greater than 1 and counting the first 1 in the sequence as the second term) is given below in pseudo-code:
a = 0
b = 1
k = 2
While n > k
a + b = c
a = b
b = c
k = k + 1
A very large Fibonacci number is the 250th in the sequence which has a value of:
The 1000th term in the sequence is:
Much, much larger values (even beyond the 10,000,000th term) can be calculated quite quickly with a simple, well-written program. See related links for a site which can quickly calculate large Fibonacci numbers (using the form Fibonacci n).
Leonardo of Pisa, also known as Fibonacci.
It is 233.
As of November 2009, the largest known certain Fibonacci prime is F81839, with 17,103 digits. It was proved prime by David Broadhurst and Bouk de Water in 2001. The largest known probable Fibonacci prime is F1968721. It has 411,439 digits and was found by Henri Lifchitz in 2009. Source: see related links, below.
the first seven Fibonacci numbers are 1,1,2,3,5,8,13. 13 is a Fibonacci number.
The 22nd Fibonacci number is 17,711
The 365th Fibonacci number is 8531073606282249384383143963212896619394786170594625964346924608389878465365.
The twelfth Fibonacci number is 144.
123 is not a Fibonacci number.
The 100th Fibonacci number is 354,224,848,179,261,915,075.
the 18th of Fibonacci number is 2584.
Yes - 5 is the fifth Fibonacci number.