Are you familiar with a formula for conjugation of cycles in $S_n$ which goes like this?
$$\sigma \circ (a_1 \cdots a_p) \circ \sigma^{-1}=(\sigma(a_1) \cdots \sigma(a_p)).$$
This formula practically lays it down for you.
You may wish to do it otherwise, i.e. test that a permutation that commutes with your cycle satisfies $\{\sigma(5),\sigma(6)\}=\{5,6\}$ (this follows from $\sigma \circ c = c\circ \sigma$). Then you can play around with the remaining elements, and see what happens to them.
1) Let me elaborate on the identity above. Suppose that you have a wheel, which lists the numbers $1,2,3,4$ clockwise. Every time you apply the permutation $(1 2 3 4)$ it's like you spin them once clockwise, thus $1$ goes to $2$, $2$ goes to $3$, ... and $4$ goes to $1$. The numbers $5,6$ are left fixed (this is what the permutation given does).
2) Now, you have to make sense of the permutation $\sigma \circ (1 2 3 4)\circ \sigma^{-1}.$ Can you check that it sends $\sigma(1)$ to $\sigma(2)$, for instance? This is really important.
3) Let $1,2,3,4$ be considered as classes (modulo $4$) for ease of notation. We thus see that the numbers $(1,2,3,4)$ and $(\sigma(1), \sigma(2), \sigma(3), \sigma(4))$ are equal as cycles, i.e. their wheels are equal (they are equal modulo cyclic order). Therefore, there exists a number $k$ modulo $4$ such that:
$$\sigma(i)\equiv i+k (\mbox{mod }4).$$
What happens to the values $\sigma(5), \sigma(6)$? Well, neither can take a value from $1$ to $4$, so $\{\sigma(5), \sigma(6)\}=\{5, 6\}.$
Let us put all of this together! $\sigma$ acts on $1,2,3,4$ as a power of our starting cycle $(1 2 3 4)$, and it acts on $5,6$ as a power of the transposition $(5 6).$ These two objects commute with each other, since they permute disjoint subsets of the total set they act on.
4) The total answer is then: $\sigma$ commutes with our cycle if and only if $\sigma=(1 2 3 4)^i (5 6)^j.$ The index $i$ runs between $0$ and $4-1$, and the index $j$ runs between $0$ and $2-1.$ Therefore we have $4\ldotp 2=8$ permutations that commute with our cycle.
There is a link that may be useful, as it deals with the same question.
Why $c(a_1 \ a_2 \dots \ a_k)c^{-1}=(c(a_1) c(a_2)… c(a_k))$?