The infinitely many numbers of the form 162*k where k is any integer.
Chat with our AI personalities
6 is not divisible by 162. 162 is divisible by 6.
81: 8 + 1 = 9 which is divisible by 9, so 81 is divisible by 9 162: 1 + 6 + 2 = 9 which is divisible by 9, so 162 is divisible by 9 199: 1 + 9 + 9 = 19 → 1 + 9 = 10 → 1 + 0 = 1 which is not divisible by 9, so 199 is not divisible by 9. 1125: 1 + 1 + 2 + 5 = 9 which is divisible by 9, so 1125 is divisible by 9. So 199 is the only one not divisible by 9.
According to my calculations, the following are evenly divisible by 9: 108, 117, 126, 135, 144, 153, 162, 171, 180, 189, and 198.
Techcially all numbers are divisible by 81, however many would result in a decimal answer. If you mean how many numbers are divisible by 81 and have an integer answer, then it is "all multiples of 81" - e.g 81 x 2, 81 x 3 etc...81, 162, 243 and keep adding 81 forever.
162 is divisible by: 1, 2, 3, 6, 9, 18, 27, 54, 81, and 162 You can make a factor tree or just try one number at a time starting from 1, which would be really slow