listed
Greatest common divisor · numtheory.openverbs.com
Greatest common divisor of two or more non-negative integers (arbitrary precision).
https://numtheory.openverbs.com/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.
https://numtheory.openverbs.com/v1/gcd
Greatest common divisor of two or more non-negative integers (arbitrary precision).
https://numtheory.openverbs.com/v1/is-prime
Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }.
https://numtheory.openverbs.com/v1/lcm
Least common multiple of two or more positive integers (arbitrary precision).
https://numtheory.openverbs.com/v1/modpow
Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive.
https://numtheory.openverbs.com/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).
This listing is taken from the catalogues and the provider named above. The price is what that source advertised.
