With the exception of the case when the remainder is zero (or there's no remainder, depending on your philosophical view) and provided the dividend and divisor are positive, then your "divisor minus remainder" is equal to the padding defined in the international standard ISO/IEC 10967, Language independent arithmetic (LIA). Part 2 of that standard defines the padding of $x \div y$ as $pad(x,y) = (\lceil x/y \rceil \times y)−x$ where $\lceil...\rceil$ is the "ceiling" function, i.e. if it's not a whole number then round up. So in your example, $16 / 3 = 5.333...$ so rounds up to $\lceil 16 / 3 \rceil = 6$, hence we need $pad(16,3)=2$ to get $16 = 6 \times 3 - 2$. On the other hand, the usual* definition of remainder would be $3 - 2 = 1$ because we prefer to write $16 = 5 \times 3 + 1$ to keep the remainder non-negative.
But in the case where the division can be performed exactly, the remainder and padding are both zero, rather than the padding being equal to the divisor (minus zero). If you are curious about the choice of terminology, and why we say the "padding" is $2$ rather than $-2$ in your example, the explanatory notes say the padding function
returns the negative of the remainder after division and ceiling. The reason for this is twofold: 1) for unsigned integer datatypes the remainder is $\le 0$, and would thus often not be representable unless negated, and 2) it is intuitively easier to think of the places left in the last unfilled group of equi-sized and packed groups" as a positive entity, a padding.
In a maths education context, I've also seen this padding called the deficit. See e.g. Liljedahl, P., Chernoff, E., & Zazkis, R. (2007). Interweaving mathematics and pedagogy in task design: A tale of one task. Journal of Mathematics Teacher Education, 10, 239-249.
More detail and some alternative terminology suggestions are available in this answer to the Math SE question Name for integer "quotient" rounded up (ceiling) instead of down (floor), and its negative or complementary "remainder".
$(*)$ It's usual in mathematics for the remainder to be defined to be non-negative. In computer science, there are several international standards, including ISO/IEC 10967 and ISO/IEC 60559 (which duplicates IEEE 754) in which the remainder is defined as what's left after rounding the quotient to the nearest whole number, and so the remainder can take both negative and positive values. For example, with $17 \div 3$ the closest integer quotient is $round(17/3) = round(5.666...) = 6$ and since $17 = 6 \times 3 + (-1)$ the so-called "IEEE remainder" is actually $-1$. On the other hand, the IEEE remainder for $16 \div 3$ is $+1$ since $round(16/3)=round(5.333...)=5$ and $16 = 5 \times 3 + 1$. The purported advantage of the IEEE remainder is that it gives the remainder, positive or negative, that is smallest (or if there's a tie, joint-smallest) in magnitude.