ForHosting KIT · Developer Utilities

Additive prime checker

An additive prime is a prime number whose decimal digits also sum to a prime. Classic examples include 2, 3, 5, 7, 11, 23, 29, 41, 43, 47, 61, 67, 83, 89, and 101: each is prime, and the sum of its digits is a small prime such as 2, 5, 7, 11, or 17.

● BetaFree · in your browser
Use it from WebAPIEmailTelegramApp soon

Numbers such as 19 and 13 are prime but fail the second test because 1+9=10 and 1+3=4 are composite. This additive prime checker accepts a single integer n greater than or equal to two, reports whether n is prime, lists the digits and their sum, says whether that sum is prime, and returns a clear is_additive_prime flag. The same pure arithmetic runs free in the browser and on the API, so homework checks and automation never disagree on a borderline case.

How to use it

Enter your values in the form above. The tool checks them before calculating and shows the result on the same page.

Check your inputs

Use the labels and units shown next to each field. If something is missing or outside the allowed range, the page points to the field to fix.

Use it again or automate it

Use the browser tool for individual checks and the API when you need the same capability in an automated workflow.

Get an answer now

Enter one set of values and see the result without building a spreadsheet or script.

Compare scenarios

Change one value at a time and rerun the calculation to understand what affects the result.

Automate repeated work

Use the API when the same calculation needs to run inside your product or workflow.

How do I use this capability?

Complete the fields above and run it on this page. The form highlights anything that needs attention.

Everything on this page is available programmatically. This section is for teams who want to wire it into their own systems; everyone else can just use the tool above.

POSThttps://api.kit.forhosting.com/numth/additive-prime

Prefer to automate it? One authenticated POST creates the task; the result comes back by webhook or a signed link. The same capability also runs here on the web, by email and from Telegram — and soon from our app too.

curl -X POST https://api.kit.forhosting.com/numth/additive-prime \
  -H "Authorization: Bearer $KIT_KEY" \
  -H "Content-Type: application/json" \
  -d '{"n":23}'
{
  "n": 23
}
{
  "task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
  "type": "numth.additive_prime",
  "status": "queued",
  "_links": {
    "result": "/tasks/tsk_…/result"
  }
}

The API is asynchronous: the call returns a task_id immediately and the result arrives by webhook. Polling is capped at 1 req/s per task.

Per request$0.002

Published price — no tokens, no invented credits. A failed task is never charged.

HTTPCodeMeaning
401unauthorizedMissing or invalid API key.
402insufficient_balanceYour balance doesn't cover the task price.
404unknown_typeThat task type doesn't exist.
429rate_limitedToo many requests. Use the webhook instead of polling.

Read the full KIT documentation →