Integer digit sum

integer-digit-sum · version 1.0.0 · Numbers & math · free, no key needed

Sum the base-b digits of the magnitude of an integer string.

Use when you need to: integer digit sum · sum of digits · digit sum in a base.

Supported

• integer digit sum
• sum of digits
• digit sum in a base

Not supported

• digital root
• digit sum of a fraction
• digit product

Behavior

• value is a canonical integer string: 0 or an optional ASCII minus followed by a non-zero leading digit, at most 1000 digits excluding sign.
• base is a JSON integer from 2 to 36; when omitted it defaults to 10.
• The sign of value is ignored: the digit sum is computed on the magnitude |value|.
• value 0 has digit sum 0 in every base.
• The result is one pass of summing base-b digits (not repeated to a single digit; see integer-digital-root for that).
• digit_sum is returned as a JSON integer.

Input

• value (string, required): max length 1001
• base (integer, optional): min 2; max 36; default 10

Output

• digit_sum (integer, required): min 0

Limits

• max digits: 1000
• min base: 2
• max base: 36

Example

Request input:

{
  "value": "12345"
}

Response:

{
  "result": {
    "digit_sum": 15
  }
}

How to call it

MCP

Connect https://computefirst.net/mcp (setup), then call execute with:

{
  "id": "integer-digit-sum",
  "version": "1.0.0",
  "input": {
    "value": "12345"
  }
}

HTTP (no key)

curl -X POST https://computefirst.net/v1/tools/integer-digit-sum/versions/1.0.0/execute \
  -H "Content-Type: application/json" \
  -d '{"value":"12345"}'

The machine-readable contract is at /v1/tools/integer-digit-sum/versions/1.0.0.

CLI

node cli.mjs run integer-digit-sum 1.0.0 --input input.json --base-url https://computefirst.net

Get the client at /clients/cli/.

Related tools

• Integer digital root: Repeatedly sum the base-b digits of the magnitude of an integer string until a single digit remains.
• Array integer cumulative sum: Replace an array of canonical integer strings with equal-length prefix sums.
• Array integer GCD: Compute the non-negative greatest common divisor of an array of canonical integer strings.
• Array integer LCM: Compute the non-negative least common multiple of an array of canonical integer strings.
• Array rational sum: Sum an array of canonical rationals and return the reduced total.
• Integer divisors: List every positive divisor of a positive integer, ascending.