We study the polytopes of binary n-strings that encode (positive) integers that are not divisible by a partivular positive integer p - the indivisibility polytopes, as well as the more general "clipped cubes". Also, we discuss a potential application to factoring. Finally, we present some...