To make sure we do not clear the other bits (Leave them untouched), we can AND with 1.
To make the mask, lets create zero bits with the length specified, ((1U<<len)-1) gives all ones, then we left shift the ones to the position we want to clear before taking the inverse of that which is all zeros on the mask, and ones everywhere else.
Now remember that AND-ing with 1 leaves the bit untouched and AND-ing with 0 clears the bit, so We clear the len number of bits while leaving the rest untouched.