A k-abeliancube is a word uvw, where the factors u, v, and w are either pairwiseequal, or have the same multiplicities for every one of their factors of length at mostk.Previously it has been shown that k-abelian cubes are avoidable over a binaryalphabet for k ≥8. Here it is proved that this holds for k ≥ 5.