{"resource":"https://numtheory.openverbs.com/v1/totient","service":"Euler's totient","areas":["other"],"answering":true,"http_status":402,"latency_ms":391,"price_usdc":0.004,"buyers_30d":1,"calls_30d":1,"description":"Euler's totient φ(n) — the count of integers in [1, n] coprime to n — for a positive integer ≤ 10^15 (it is computed from the prime factorization).","id":"49ec19958ad4","category":"Unclassified","accuracy":null,"tool_calls":null,"checked_day":"2026-10-11","page":"https://velliumandco.com/sellers/49ec19958ad4"}