Spec

Extraits de code

curl "https://api.oanor.com/numbertheory-api/v1/meta" \
  -H "x-oanor-key: oanor_test_..."

await fetch("https://api.oanor.com/numbertheory-api/v1/meta", {
  headers: { "x-oanor-key": "oanor_test_..." }
});

$ch = curl_init("https://api.oanor.com/numbertheory-api/v1/meta");
curl_setopt($ch, CURLOPT_HTTPHEADER, ["x-oanor-key: oanor_test_..."]);
curl_setopt($ch, CURLOPT_RETURNTRANSFER, true);
$out = curl_exec($ch);

import requests
requests.get(
    "https://api.oanor.com/numbertheory-api/v1/meta",
    headers={"x-oanor-key": "oanor_test_..."}
)

Exemple de réponse

Une réponse réelle de ce endpoint, capturée lors du dernier contrôle de santé.

{
    "data": {
        "name": "Number Theory API",
        "notes": "Numbers up to 1e12. The full divisor list is returned only for n ≤ 10,000,000 (count and sum are always given). Nothing is stored.",
        "version": "v1",
        "endpoints": [
            {
                "path": "/v1/factorize",
                "params": {
                    "number": "1 to 1e12 (required)",
                    "divisors": "false to skip the divisor list"
                },
                "returns": "prime factors, divisor count/sum, divisors, is_perfect"
            },
            {
                "path": "/v1/gcd",
                "params": {
                    "a": "required",
                    "b": "required"
                },
                "returns": "gcd, lcm, whether coprime"
            },
            {
                "path": "/v1/is-prime",
                "params": {
                    "number": "required"
                },
                "returns": "is_prime + next and previous prime"
            },
            {
                "path": "/v1/meta",
                "params": [],
                "returns": "this document"
            }
        ],
        "description": "An integer toolkit: prime factorization with exponents, the divisors of a number (count and sum), greatest common divisor and least common multiple, and primality testing with the next and previous prime. Pure local, no key."
    },
    "meta": {
        "timestamp": "2026-06-03T01:09:40.840Z",
        "request_id": "9e7a3a3a-af02-4108-810e-e36696ae8df4"
    },
    "status": "ok",
    "message": "Meta",
    "success": true
}