Directory / numtheory.openverbs.com
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).
# 1. Ask the endpoint what it costs (no payment, no wallet needed): curl -i -X GET 'https://numtheory.openverbs.com/v1/totient' # -> HTTP/1.1 402 Payment Required # the response carries the price, asset and pay-to address. # 2. Pay and retry with any x402 client: npx x402-fetch 'https://numtheory.openverbs.com/v1/totient'
Endpoint: https://numtheory.openverbs.com/v1/totient. Operated by numtheory.openverbs.com, not by Animica. Price and availability were correct at the last probe on 2026-10-01 and are set by the operator, who may change them.
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 pr…
Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }.