oanor
Iscriviti gratis
Mercata Prezzi Caratteristiche Accedi

API · /numbertheory-api

Number Theory API

salutare 4,587 Abbonati

An integer toolkit as an API. Factorize any number into its prime factors with exponents (and a readable 2^3 × 3^2 × 5 form), with the divisor count, the divisor sum, the full list of divisors and whether the number is perfect; find the greatest common divisor and least common multiple of two numbers (and whether they are coprime); and test primality, returning the next and previous prime. Handles numbers up to a trillion. Perfect for maths education and puzzles, cryptography demos, generating test data and any time you need the building blocks of a number. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 4 endpoints. A focused integer toolkit, distinct from a general math-expression engine.

#number-theory #primes #factorization #math #integers #developer-tools
api.oanor.com/numbertheory-api
Ottieni una chiave API Prova nel parco giochi → Contatta provider

Specifica leggibile dalle macchine, così gli agenti AI possono integrare questa API.

/api/numbertheory-api/openapi.json
/api/numbertheory-api/llms.txt

Individuazione: GET /api/index.json elenca ogni API.

API salute

salutare
Tempo di attività
100.00%
Sondaggi del server · 24 ore su 24
Latenza media
80 ms
Sondaggi del server · 24 ore su 24
Abbonati
4,587
attiva
Chiamate totali
76
ultimi 7 giorni
status Pagina di stato completa → · 12 sonde/24h

Prezzi

Scegli un livello: fatturazione mensile, annullamento in qualsiasi momento.

Free

Gratis

  • 1,135 chiamate/mese
  • 2 richieste/secondo
  • Tetto rigido (429 sopra la quota, nessuna eccedenza)
  • 每月1,135次调用
  • 每秒2个请求
  • 因式分解 + 最大公约数/最小公倍数 + 素数判定
  • 无需信用卡
Accedi per abbonarti

Starter

€1.75 /mese

  • 9,750 chiamate/mese
  • 8 richieste/secondo
  • Tetto rigido (429 sopra la quota, nessuna eccedenza)
  • 9.75k calls/month
  • 8 req/sec
  • Divisors + perfect numbers
  • Email support
Accedi per abbonarti

Pro

€21.65 /mese

  • 148,500 chiamate/mese
  • 20 richieste/secondo
  • Tetto rigido (429 sopra la quota, nessuna eccedenza)
  • 148.5k calls/month
  • 20 req/sec
  • Education / crypto-demo pipelines
  • Priority support
Accedi per abbonarti

Mega

€59.65 /mese

  • 785,000 chiamate/mese
  • 50 richieste/secondo
  • Tetto rigido (429 sopra la quota, nessuna eccedenza)
  • 785k calls/month
  • 50 req/sec
  • Platform scale
  • Dedicated SLA
Accedi per abbonarti

Costruito da

P
PremiumApi

Correlato APIs

Altro APIs con tag sovrapposti.

Collatz Sequence API

Collatz 猜想（"3n+1" 或冰雹问题）作为一个 API，在本地确定性地计算。给它任意正整数，序列端点返回完整的冰雹路径——每一步，偶数减半，奇数乘以 3 加 1（3n+1）——以及总停止时间（到达 1 所需的步数）和序列达到的峰值。从 6 开始，路径为 6, 3, 10, 5, 16, 8, 4, 2, 1——八步，峰值为 16；著名的长起始数 27 需要 111 步，峰值高达 9232 然后下降。steps 端点仅返回停止时间和峰值高度，不返回整个路径，用于快速批量扫描大攀升和长尾的位置。所有算术运算使用任意精度整数，因此即使小起始数膨胀到数百万，峰值也保持精确，并且安全上限确保每个请求有界。接受高达一百万亿的起始数。所有计算在本地确定性地进行，因此即时且私密。非常适合数学教育、数论、娱乐数学和谜题应用开发者、序列和冰雹可视化工具，以及关于算术中最著名未解决问题教学材料。纯本地计算——无需密钥，无需第三方服务，即时。实时，不存储任何内容。2 个计算端点。这是专门的 Collatz/3n+1 序列；对于质因数分解或 GCD，请使用数论 API。

api.oanor.com/collatz-api

Number Sequences API

Generate famous integer sequences and test membership, with exact big-integer maths. The generate endpoint returns the first N terms of a sequence — Fibonacci, Lucas, prime numbers, triangular, square, cube, factorial, Catalan, pentagonal and tetrahedral numbers, plus parameterised arithmetic (a start and a step), geometric (a start and a ratio) and powers (any base). The contains endpoint tells you whether a given number belongs to a sequence — is 233 a Fibonacci number, is 21 triangular, is 97 prime, is 720 a factorial — using fast closed-form tests for primes, squares, cubes, triangular, pentagonal and Fibonacci numbers and an exact search for the rest, and it returns the term index where it is known. Because everything is computed with arbitrary-precision integers, terms beyond the usual floating-point limit are returned exactly as decimal strings and never overflow. It runs entirely locally, so it is instant, deterministic and private. Ideal for education and maths tooling, coding challenges and puzzles, test-data generation, recreational mathematics and number-theory experiments. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. This generates and tests integer sequences; to factorize a single number or get its divisors use a number-theory API.

api.oanor.com/sequences-api

Combinatorics API

Combinatorics maths as an API, computed locally and deterministically with exact arbitrary-precision integers. The factorial endpoint computes n! = 1·2·3···n (with 0! = 1) and returns it exactly as a string together with its digit count, so even very large factorials stay precise. The permutations endpoint counts ordered arrangements: without repetition nPr = n!/(n−r)! arrangements of r items chosen from n, and with repetition n^r, where each of the r positions may be any of the n items. The combinations endpoint counts unordered selections: without repetition the binomial coefficient nCr = n!/(r!·(n−r)!), and with repetition (multisets) C(n+r−1, r), where repeats are allowed. All results are computed with BigInt so they are exact no matter how large, returned as a string with the number of digits and a floating-point approximation when it fits. n and r are non-negative integers up to 100000. Everything is computed locally and deterministically, so it is instant and private. Ideal for probability, statistics, lottery, game-design, cryptography and education app developers, counting and odds tools, and discrete-maths teaching. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. This is counting combinatorics; for modular arithmetic use a modular API and for descriptive statistics a statistics API.

api.oanor.com/combinatorics-api

Modular Arithmetic API

Modular-arithmetic maths as an API, computed locally and deterministically with exact big-integer arithmetic. The power endpoint computes modular exponentiation, aᵇ mod m, by square-and-multiply, fast and exact even for the huge exponents used in cryptography. The inverse endpoint finds the modular multiplicative inverse a⁻¹ mod m with the extended Euclidean algorithm, returning the inverse when a and m are coprime and reporting the gcd when no inverse exists. The totient endpoint computes Euler's totient φ(n) — the count of integers from 1 to n coprime to n — with the prime factorization it comes from, and an optional Euler-theorem check that a^φ(n) ≡ 1 (mod n) for a coprime base. These are the building blocks of RSA and much of modern cryptography. Inputs are integers and can be passed as strings for very large values. Everything is computed locally and deterministically, so it is instant and private. Ideal for cryptography, security, blockchain and mathematics app developers, RSA and number-theory tools, and computer-science education. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. This is modular arithmetic; for prime factorization and GCD use a number-theory API and for integer sequences a sequences API.

api.oanor.com/modular-api

Domande frequenti

Risposte rapide su prezzi, quote e integrazione.

Come ottengo una chiave API per Number Theory API?
Registrati gratuitamente su oanor.com, genera una chiave API dalla dashboard sviluppatore e chiama Number Theory API con l'header x-oanor-key. Nessuna carta di credito richiesta per il piano gratuito.
Qual è il limite di velocità di Number Theory API?
Il piano gratuito consente 1 richiesta al secondo. I piani a pagamento arrivano fino a 50 richieste al secondo nel piano Mega. I limiti rigorosi restituiscono HTTP 429 oltre la quota — nessuna spesa imprevista.
Quanto costa Number Theory API?
Number Theory API ha un piano gratuito con 100 chiamate / mese. I piani a pagamento partono da €1.75 / mese con quote più alte e limiti di velocità più rapidi.
Posso cancellare l'abbonamento in qualsiasi momento?
Sì. I piani sono fatturati mensilmente e puoi cancellare in qualsiasi momento dalla dashboard di fatturazione. Nessun contratto a lungo termine e nessuna penale di cancellazione.
Number Theory API è conforme al GDPR?
Tutte le richieste a Number Theory API passano attraverso il nostro gateway in UE. La tua chiave upstream non lascia mai il nostro server e nessun dato personale viene condiviso con il fornitore upstream oltre alla richiesta inviata.

Scegli un endpoint dall'elenco a sinistra per visualizzarne i dettagli e provarlo.

Frammenti di codice

Iscriviti per ottenere una chiave API, quindi chiama qualsiasi percorso sotto il tuo slug.

curl https://api.oanor.com/numbertheory-api/SOME_PATH \
  -H "x-oanor-key: oanor_test_..."
const res = await fetch("https://api.oanor.com/numbertheory-api/SOME_PATH", {
  headers: { "x-oanor-key": "oanor_test_..." }
});
const data = await res.json();
$ch = curl_init("https://api.oanor.com/numbertheory-api/SOME_PATH");
curl_setopt($ch, CURLOPT_RETURNTRANSFER, true);
curl_setopt($ch, CURLOPT_HTTPHEADER, ["x-oanor-key: oanor_test_..."]);
$response = curl_exec($ch);
import requests
r = requests.get(
    "https://api.oanor.com/numbertheory-api/SOME_PATH",
    headers={"x-oanor-key": "oanor_test_..."},
)
print(r.json())

Valutazioni

Accedi per votare.

Nessuna recensione ancora.

Discussione

Fai domande, condividi consigli, ricevi risposte dal provider e dagli altri sviluppatori. Pubblico — chiunque può leggere.

Accedi per scrivere o rispondere.

Accedi

Nuova discussione

/ 4000

📌 Fissato 🔒 Bloccato

·

· ·

/ 4000

🔒 Discussione bloccata — non si può più rispondere.

  • Nessuna discussione — inizia tu.

Supporto

Supporto privato 1:1 con il provider — fatturazione, integrazione, account. Solo tu e il team del provider vedete questi thread.

Accedi per aprire un ticket di supporto.

Accedi

Apri nuovo ticket

Descrivi cosa ti serve. Il team del provider riceve un'email e risponde sulla pagina del ticket.

  • Nessun ticket per questa API.

Abbonamento attivo: le chiamate possono iniziare subito.

Invia la tua prima richiesta —

Abbonamento attivo: copia uno snippet e avvia la tua prima chiamata.