The sum of all the four-digit numbers that can be formed using all the digits 2, 1, 2, 3 is equal to _______.
We have to form four-digit numbers with the multiset of digits {2, 2, 1, 3}.
Because two 2’s are identical, the number of distinct arrangements is .
Let us compute the required sum by analysing the contribution of each digit in each place (thousands, hundreds, tens, ones).
Step 1: How many numbers have a given digit in a fixed place?
Fix one position, say the thousands place.
• If the digit there is 1, the remaining digits are {2, 2, 3}.
Distinct permutations of these three digits .
• If the digit there is 3, the remaining digits are {2, 2, 1}.
Again permutations.
• If the digit there is 2, after placing one 2 we are left with {2, 1, 3} (all distinct).
Permutations of three distinct digits .
So, in one fixed place, 1 appears 3 times, 3 appears 3 times and 2 appears 6 times.
Step 2: Contribution to the sum from each place
Thousands place (weight ):
.
Because every place is symmetrical, the same frequency counts apply to the hundreds, tens and ones places.
• Hundreds place (weight ):
.
• Tens place (weight ):
.
• Ones place (weight ):
.
Step 3: Total sum
Add the contributions from all four places:
.
Hence, the sum of all distinct four-digit numbers that can be formed with the digits 2, 1, 2, 3 is .
Tagged Formation of numbers and divisibility. Machine-assigned, so read it as a strong shortlist rather than a verdict.