What is the maximum possible value of $k$ for which $2013$ can be written as a sum of $k$ consecutive positive integers?
1. Let \( 2013 = (n+1) + (n+2) + \cdots + (n+k) \), where \( n \geq 0 \) and \( k \geq 1 \). This represents the sum of \( k \) consecutive positive integers starting from \( n+1 \).

2. The sum of \( k \) consecutive integers starting from \( n+1 \) can be written as:
   \[
   (n+1) + (n+2) + \cdots + (n+k) = \sum_{i=1}^{k} (n+i)
   \]

3. Using the formula for the sum of an arithmetic series, we have:
   \[
   \sum_{i=1}^{k} (n+i) = k \cdot n + \sum_{i=1}^{k} i = k \cdot n + \frac{k(k+1)}{2}
   \]

4. Therefore, the equation becomes:
   \[
   2013 = k \cdot n + \frac{k(k+1)}{2}
   \]

5. Rearrange the equation to solve for \( n \):
   \[
   2013 = k \cdot n + \frac{k(k+1)}{2}
   \]
   \[
   4026 = 2kn + k^2 + k
   \]
   \[
   4026 = k(k + 2n + 1)
   \]

6. To maximize \( k \), we need to find the largest \( k \) such that \( 4026 \) is divisible by \( k \). We start by factoring \( 4026 \):
   \[
   4026 = 2 \times 3 \times 11 \times 61
   \]

7. The factors of \( 4026 \) are \( 1, 2, 3, 6, 11, 22, 33, 61, 66, 122, 183, 366, 671, 1342, 2013, 4026 \).

8. We test the largest factor, \( k = 61 \):
   \[
   4026 = 61(k + 2n + 1)
   \]
   \[
   k + 2n + 1 = \frac{4026}{61} = 66
   \]
   \[
   61 + 2n + 1 = 66
   \]
   \[
   2n = 4
   \]
   \[
   n = 2
   \]

9. Therefore, \( n = 2 \) and \( k = 61 \) is a valid solution. We verify:
   \[
   2013 = (2+1) + (2+2) + \cdots + (2+61)
   \]
   \[
   2013 = 3 + 4 + \cdots + 63
   \]
   \[
   \sum_{i=3}^{63} i = \frac{61 \cdot (3 + 63)}{2} = \frac{61 \cdot 66}{2} = 2013
   \]

10. Thus, the maximum possible value of \( k \) is \( 61 \).

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