In this paper, we show that the maximum number of bent component functions of a vectorial function F : GF(2)ⁿ → GF(2)ⁿ is 2ⁿ - 2^n/2. We also show that it is very easy to construct such functions. However, it is a much more challenging task to find such functions in polynomial form F ∈ GF(2ⁿ)[x], where F has only a few terms. The only known power functions having such a large number of bent components are x^d, where d = 2^n/2 + 1. In this paper, we show that the binomials Fⁱ (x) = x²ⁱ (x + x(2^n/2)) also have such a large number of bent components, and these binomials are inequivalent to the monomials x(2^n/2+1) if 0 <; i <; n/2. In addition, the functions Fi have differential properties much better than x(2^n/2+1). We also determine the complete Walsh spectrum of our functions when n/2 is odd and gcd(i, n/2) = 1.