Suppose the polynomial $f(x) = x^{2014}$ is equal to $f(x) =\sum^{2014}_{k=0} a_k {x \choose k}$ for some real numbers $a_0,... , a_{2014}$. Find the largest integer $m$ such that $2^m$ divides $a_{2013}$.
1. We start with the polynomial \( f(x) = x^{2014} \) and express it in the form \( f(x) = \sum_{k=0}^{2014} a_k \binom{x}{k} \). We need to find the coefficients \( a_k \).

2. Recall that the binomial coefficient \( \binom{x}{k} \) can be written as:
   \[
   \binom{x}{k} = \frac{x(x-1)(x-2)\cdots(x-k+1)}{k!}
   \]
   This means that \( \binom{x}{k} \) is a polynomial of degree \( k \).

3. To express \( x^{2014} \) in terms of \( \binom{x}{k} \), we need to find the coefficients \( a_k \) such that:
   \[
   x^{2014} = \sum_{k=0}^{2014} a_k \binom{x}{k}
   \]

4. The highest degree term \( x^{2014} \) occurs only when \( k = 2014 \). Therefore, we must have:
   \[
   a_{2014} \binom{x}{2014} = x^{2014}
   \]
   Since \( \binom{x}{2014} = \frac{x(x-1)\cdots(x-2013)}{2014!} \), we need:
   \[
   a_{2014} = 2014!
   \]

5. Next, we consider the term \( x^{2013} \). The term \( x^{2013} \) in \( x^{2014} \) can be generated by the expansion of \( \binom{x}{2014} \) and \( \binom{x}{2013} \). Specifically:
   \[
   \binom{x}{2014} = \frac{x(x-1)\cdots(x-2013)}{2014!}
   \]
   The coefficient of \( x^{2013} \) in this expansion is:
   \[
   -\sum_{i=0}^{2013} i = -\frac{2013 \cdot 2014}{2} = -1007 \cdot 2013
   \]

6. Therefore, the coefficient \( a_{2013} \) must account for this term:
   \[
   a_{2013} \binom{x}{2013} = -1007 \cdot 2013 \cdot \binom{x}{2013}
   \]
   Since \( \binom{x}{2013} = \frac{x(x-1)\cdots(x-2012)}{2013!} \), we have:
   \[
   a_{2013} = -1007 \cdot 2013 \cdot 2013!
   \]

7. To find the largest integer \( m \) such that \( 2^m \) divides \( a_{2013} \), we need to determine the power of 2 in the factorization of \( -1007 \cdot 2013 \cdot 2013! \).

8. The numbers 1007 and 2013 are odd, so they do not contribute any factors of 2. We need to find the power of 2 in \( 2013! \). Using Legendre's formula, the power of a prime \( p \) in \( n! \) is given by:
   \[
   \sum_{k=1}^{\infty} \left\lfloor \frac{n}{p^k} \right\rfloor
   \]
   For \( p = 2 \) and \( n = 2013 \):
   \[
   \left\lfloor \frac{2013}{2} \right\rfloor + \left\lfloor \frac{2013}{4} \right\rfloor + \left\lfloor \frac{2013}{8} \right\rfloor + \left\lfloor \frac{2013}{16} \right\rfloor + \left\lfloor \frac{2013}{32} \right\rfloor + \left\lfloor \frac{2013}{64} \right\rfloor + \left\lfloor \frac{2013}{128} \right\rfloor + \left\lfloor \frac{2013}{256} \right\rfloor + \left\lfloor \frac{2013}{512} \right\rfloor + \left\lfloor \frac{2013}{1024} \right\rfloor
   \]
   \[
   = 1006 + 503 + 251 + 125 + 62 + 31 + 15 + 7 + 3 + 1 = 2004
   \]

9. Therefore, the largest integer \( m \) such that \( 2^m \) divides \( a_{2013} \) is \( 2004 \).

The final answer is \( \boxed{2004} \).