On the palindromic decomposition of binary words

We prove a precise formula for the minimal number K(n) such that every binary word of length $n$ can be divided into K(n) palindromes. Also we estimate the average number $\text{ol}K(n)$ of palindromes composing a random binary word of the length n.