Courses
Courses for Kids
Free study material
Offline Centres
More
Store

# Find the sum of all the numbers that can be formed with the digits 2,3,4,5 taken all at a time.

Last updated date: 17th Jun 2024
Total views: 393.6k
Views today: 5.93k
Verified
393.6k+ views
Hint: We start solving the problem by finding the total possibilities of getting numbers by fixing each digit in unit place. We then find the sum of all the numbers present in the unit place. Similarly, we multiply 10 for the sum of digits in tenth place, 100 for the sum of digits in tenth place and 1000 for the sum of digits in thousandth place. We then add all these sums to get the required answer.

According to the problem, we need to find the sum of all the numbers that can be formed with the digits 2,3,4,5 taken all at a time.
Let us first fix a number in a unit place and find the total number of words possible due on fixing this number.
We need to arrange the remaining three places with three digits. We know that the number of ways of arranging n objects in n places is $n!$ ways.
So, we get $3!=6$ numbers on fixing the unit place with a particular digit.
Now, let us find the sum of all digits. We get sum as $2+3+4+5=14$.
Now, we get a sum of digits in units place for all the numbers as $14\times 6=84$.
We use the same digits in ten, hundred and thousand places also. So, the sum of those digits will also be 84 but with the multiplication of its place value.
i.e., We multiply the sum of the digits in tenth place with 10, hundredth place with 100 and so on. We then add these sums.
So, we get the sum of all the numbers that can be formed with the digits 2,3,4,5 taken all at a time is $\left( 84\times 1000 \right)+\left( 84\times 100 \right)+\left( 84\times 10 \right)+\left( 84\times 1 \right)$.
$\Rightarrow$ Sum = $84000+8400+840+84$.
$\Rightarrow$ Sum = $93324$.
We have found the sum of all the numbers that can be formed with the digits 2,3,4,5 taken all at a time as 93324.

Note: Alternatively, we can use the formula for the sum of numbers as $\left( n-1 \right)!\times \left( \text{sum of digits} \right)\times \left( 11111......ntimes \right)$. We can also solve this problem by writing all the possible numbers and finding the sum of them which will be time taking and make us confused. We should know that the value of the digits is determined by the place where they were present. We should check whether there is zero in the given digits and whether there are any repetitions present in the numbers. Similarly, we can expect problems to find the sum of numbers formed by these digits with repetition allowed.