Task: Given a base-10 integer, n, convert it to binary (base-2). Then find and print the base-10 integer denoting the maximum number of consecutive 1's in n's binary representation.
Sample: The binary representation of 13 is 1101, so the maximum number of consecutive 1's is 2.