{"uid":"cap_e72aie6blFSYX1n-pqsRh","slug":"numora-prime-factorization-api-39095d96","name":"Numora Prime Factorization API","description":"100 pure math computation endpoints for AI agents. Statistics, financial math, linear algebra, equation solving, calculus, number theory, sequence generation, and unit conversions. Zero external dependencies. x402 micropayments on Base.","url":"https://numormo.vercel.app/api/number/prime-factorization","method":"POST","headers":{},"bodySchema":{"type":"object","required":["n"],"properties":{"n":{"type":"integer"}}},"responseSchema":{"type":"object","required":["success","result","computation"],"properties":{"result":{"type":"object","description":"Computation result varies by endpoint"},"success":{"type":"boolean","description":"Always true on success"},"computation":{"type":"string","description":"Human-readable description of what was computed"}}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.1","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"registry","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.1/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_JuL0nECz-vQ0D9cxx0nks","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.1","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes the prime factorization of an integer, returning its prime factors and their exponents.","exampleAgentPrompt":"Can you find the prime factorization of 360 for me?","exampleUseCases":[{"title":"Cryptography key size analysis","prompt":"What is the prime factorization of 2048? I need to understand its factor structure for a math security exercise."},{"title":"Teaching prime factorization","prompt":"Break down 1260 into its prime factors with exponents so I can show my student how it works step by step."},{"title":"Checking divisibility properties","prompt":"Give me the prime factorization of 9240 — I need to know all the prime factors and their powers to figure out how many divisors it has."}],"resultDescription":"Returns a JSON object with a `success` boolean, a `result` object containing the prime factors and their exponents (e.g. {2: 3, 3: 2, 5: 1} for 360), and a `computation` string with a human-readable description of what was computed.","failureModes":["Missing required field `n` returns a validation error","Non-integer or float input may cause a 400 error","Very large integers may exceed computation limits or time out","Payment failure or insufficient USDC balance blocks the request via x402","Negative integers or zero may return an error or undefined behavior depending on implementation"],"whenToPreferThis":"Choose this endpoint when you need a reliable, serverless, zero-dependency computation of prime factorization for any integer — especially in agent workflows requiring number theory operations without relying on a general-purpose code executor. Ideal for math tutoring agents, cryptography analysis, divisor counting, and any scenario where you need a structured, machine-readable factorization result rather than a natural language explanation.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T19:01:02.158Z","isFirstParty":false}