Smallest Triplet of Integers whose Product with Divisor Count are Equal

Theorem
Let $\map \tau n$ denote the divisor counting ($\tau$) function: the number of divisors of $n$.

The smallest set of $3$ integers $T$ such that $m \, \map \tau m$ is equal for each $m \in T$ is:
 * $\set {168, 192, 224}$