Euler's totient
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).
Go to this service →Our latest check (2026-10-11)
- Answering
- Yes — valid x402 payment terms
- Time to answer
- 391 ms
- Price
- $0.004 per call
- Paying buyers, last 30 days
- 1 (directory's own records)
- Paid calls, last 30 days
- 1
- Category
- Unclassified
- Address
- https://numtheory.openverbs.com/v1/totient
Accuracy: paid answers checked against an independent record
Not yet in our paid checks. A seller we have not checked has neither passed nor failed.
For agents
This page as JSON: /sellers/49ec19958ad4.json. Paid lookup by address: GET /api/seller?resource=… ($0.001, x402).