← All endpoints
numtheory.openverbs.com v1 totient
https://numtheory.openverbs.com/v1/totient
answers 402
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).
We sent a real
POST request to this endpoint and it
answered 402 with payment requirements we could parse.
- Price
- $0.004
- Network
- base
- Pay to
- 0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A
- Spec dialect
- v2 (declares x402Version 2)
- Transport
- PAYMENT-REQUIRED header
- HTTP method
- POST
- Response latency
- 269 ms
- Payment options
- 1 usable of 1
- Last checked
- 2026-09-06T01:20:10.807Z (23d ago)
- Category
- other
Re-check it yourself:
curl "https://api.the402.dev/validate?url=https%3A%2F%2Fnumtheory.openverbs.com%2Fv1%2Ftotient"