Since the sum of the digits is 17 and 1 + 7 = 8, the sum of all the digits before the last two digits is 17 - 8 = 9. So we are looking for a number of the form ab...yz17, where a + b + ... + y + z = 9.
Also, since ab...yz17 is divisible by 17, that means ab..yz00 must be divisible by 17 also, since it is exactly 17 less. This in turn means that ab..yz must be divisible by 17. So we have reduced it to looking for a number that is divisible by 17 and that has digits summing to 9.
Looking through the first several multiples of 17 we come across 153. This is a multiple of 17 (17 * 9), and it's digits sum to 9 (1 + 5 + 3 = 9).
So a number that works is 15317. It ends in 17 (check), it is divisible by 17 (15317/17 = 901, check), and the sum of its digits is equal to 17 (1+5+3+1+7 = 17, check).
The number (in base 10, I presume) will look like this:
cba17
Also, the first 10 multiples of 17 are {17, 34, 51, 68, 85, 102, 119, 136, 153, 170}
The only multiple that ends with '17' is the first one.
Therefore, the last number in the quotient will be 1. This means that the last two digits must stand by themselves when you have divided the cba part.
In other words, cba itself must be a multiple of 17.
The digits add up to 17. The digits '1' and '7' add up to 8. This leaves nine as the sum of c+b+a
Go through the list of multiples: 153 fits the bill.
check
15317
ends in '17'
is divisible by 17 (we built it that way)
digits add up to 17 (we built it that way).