Prime-factorize a positive integer (≤ 10^15 so the computation is always fast)
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 prime.
6 resources listed under numtheory.openverbs.com.
Source: https://api.cdp.coinbase.com/platform/v2/x402/discovery/resources · last updated 2026-10-14
These 6 resources were mirrored from Coinbase's public Bazaar. Claim them all at once by submitting your own manifest — no account required, and it always overrides the mirrored copy.
Claim this providerPrime-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 prime.
Greatest common divisor of two or more non-negative integers (arbitrary precision).
Least common multiple of two or more positive integers (arbitrary precision).
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).
Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive.
Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }.
All resources from this provider: /discovery/merchant (by payment address) or filter /discovery/resources.