How this calculation works
A whole number and its digit sum leave the same remainder modulo 9 because each power of ten leaves remainder 1.
S = d₁ + d₂ + … + dₖA worked example
For 582, add 5 + 8 + 2 to get 15.
Good to know
The digit sum can have more than one digit.
Reference: OpenStax Prealgebra (opens in a new tab) ↗
Add the digits once
For 582, separate the digits into 5, 8 and 2 and add them. First 5 + 8 = 13, then 13 + 2 = 15. This calculator stops at 15. Repeating the operation would give 1 + 5 = 6, which is the digital root and is available in the Digital root calculator.
Place-value weights do not appear in a digit sum. The digits contribute 5, 8 and 2 rather than 500, 80 and 2. Rearranging the digits therefore preserves the digit sum. The numbers 582, 852 and 258 all give 15, even though their numerical values differ.
Check divisibility by three or nine
Every power of ten leaves remainder 1 when divided by 9. Consequently 500 + 80 + 2 and 5 + 8 + 2 have the same remainder modulo 9. Since 15 leaves remainder 6, 582 also leaves remainder 6. It is therefore not divisible by 9. Both values are divisible by 3 because 15 is divisible by 3.
The Divisibility test calculator can confirm the remainder for the original number. A matching digit sum alone does not prove that two numbers are equal. If a transcription swaps two digits, the sum stays the same, so this check will miss that error. Treat it as one arithmetic check with known blind spots.
A few questions, answered
What happens to zeros?
A zero contributes zero to the sum. For 5,002 the sum is 5 + 0 + 0 + 2 = 7.
Why can the result have two digits?
The operation is a single pass over the original digits. Adding 9 + 9 + 9 gives 27, and the calculator returns 27.