It's important to note that we DO, in fact, know that k is an integer. The question stem, "Is
integer k a multiple of 14?" tells us it is.
(if the question stem were "is k a multiple of 14?" or "is k an integer that is divisible by 14?" we would not know. But with the wording the way it is, we do know.)
Nonetheless, statement one is till insufficient. All we are told is that (integer) k is
greater than some large number. But only every fourteenth integer will be on the "14 times table". In other words some of the integers greater than 13! will be a multiple of 14 and some of them won't. 14!, for example will be a multiple of 14, but the next integer up, 14! + 1, will not. Sometimes Yes, sometimes No; Statement 1 is insufficient.
As others have pointed out, the best way to see why statement two is sufficient is to consider prime factorization. If k/14 is going to be an integer, then k/(2*7) will be an integer. And if k/(2*7) is to be an integer, then the denominator must cancel out completely. In other words, k must include a 2 and a 7 in its prime factorization. Statement 2 tells us k could be 7! or 8! or 9! (and so on). No matter what, k will have at least one 2 and at least one 7 in its PF. Sufficient.
B.