Prime factorization
numtheory.openverbs.com
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.
- Category
- Service
- Networks
- Base
- Starting price
- $0.004
- Paid calls, 30 days
- 8
Paid endpoints
6 endpoints, sorted by usage. Prices are per request.
| Endpoint | Price | Network | Facilitator | Calls / 30d |
|---|---|---|---|---|
POST/v1/factorize 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. | $0.004 | Base | Coinbase CDP | 2 |
POST/v1/gcd Greatest common divisor of two or more non-negative integers (arbitrary precision). | $0.004 | Base | Coinbase CDP | 2 |
POST/v1/is-prime Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }. | $0.004 | Base | Coinbase CDP | 1 |
POST/v1/lcm Least common multiple of two or more positive integers (arbitrary precision). | $0.004 | Base | Coinbase CDP | 1 |
POST/v1/modpow Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive. | $0.004 | Base | Coinbase CDP | 1 |
POST/v1/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). | $0.004 | Base | Coinbase CDP | 1 |
Is this your project? Suggest an edit.