Step 1: Understanding the Concept:
For a set of $n$ distinct non-zero digits, each digit appears in each place (units, tens, hundreds, etc.) $(n-1)!$ times across all possible permutations.
Key Formula or Approach:
Sum of all $n$-digit numbers formed using $n$ distinct digits is:
\[ (\text{Sum of digits}) \times (n-1)! \times (11\dots1 \text{ repeated } n \text{ times}) \]
Step 2: Detailed Explanation:
1. Identify the values:
Digits are $\{3, 5, 7\}$, so $n = 3$.
Sum of digits = $3 + 5 + 7 = 15$.
2. Calculate frequency of each digit in each position:
Frequency = $(3-1)! = 2! = 2$.
3. Calculate the total sum:
\[ \text{Sum} = 15 \times 2 \times (111) \]
\[ \text{Sum} = 30 \times 111 = 3330 \]
Step 3: Final Answer:
The sum of all numbers in $S$ is 3330.