Prime factorization + divisors

Extraits de code

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

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

$ch = curl_init("https://api.oanor.com/numbertheory-api/v1/factorize");
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/factorize",
    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": {
        "number": 360,
        "divisors": [
            1,
            2,
            3,
            4,
            5,
            6,
            8,
            9,
            10,
            12,
            15,
            18,
            20,
            24,
            30,
            36,
            40,
            45,
            60,
            72,
            90,
            120,
            180,
            360
        ],
        "is_prime": false,
        "is_perfect": false,
        "divisor_sum": 1170,
        "divisor_count": 24,
        "factorization": "2^3 × 3^2 × 5",
        "prime_factors": [
            {
                "prime": 2,
                "exponent": 3
            },
            {
                "prime": 3,
                "exponent": 2
            },
            {
                "prime": 5,
                "exponent": 1
            }
        ]
    },
    "meta": {
        "timestamp": "2026-06-03T01:09:40.581Z",
        "request_id": "de0d9194-b95b-4471-a306-d9d2aa583cfc"
    },
    "status": "ok",
    "message": "Prime factorization",
    "success": true
}