find the smallest number of 6 digits which is exactly divisible by 111
"smallest number of 6 digits is 100000 . on dividing 100000 by 111 , we get 100 as remainder . number to be added = ( 111 - 100 ) - 11 . hence , required number = 100011 answer a 100011"
add(subtract(multiply(const_10, multiply(const_100, const_100)), const_100), 111)