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).

Open endpoint ↗

Price per call: $0.004
Chain: Base
Method: POST
Paid calls · 30 days: 1

Call it from code

This API is run by its own provider and paid directly through x402. We list it so you can find it; we don't route or hold the payment.

import { x402Client, wrapFetchWithPayment } from "@x402/fetch";
import { registerExactEvmScheme } from "@x402/evm/exact/client";

const client = new x402Client();
registerExactEvmScheme(client, { signer: agentAccount });

const pay = wrapFetchWithPayment(fetch, client);
const res = await pay("https://numtheory.openverbs.com/v1/totient", { method: "POST" });
console.log(await res.json());

https://numtheory.openverbs.com/v1/totient