{"resource":"https://numtheory.openverbs.com/v1/factorize","service":"Prime factorization","areas":["other"],"answering":true,"http_status":402,"latency_ms":435,"price_usdc":0.004,"buyers_30d":2,"calls_30d":2,"description":"Prime-factorize a positive integer (≤ 10^15 so the computation is always fast). Returns the prime factors with exponents, the divisor count, and whether n is prime.","id":"cb039148a2ed","category":"Unclassified","accuracy":null,"tool_calls":null,"checked_day":"2026-10-11","page":"https://velliumandco.com/sellers/cb039148a2ed"}