{"uid":"cap_KvLTfYcMa_2fqw_s4_V1A","slug":"numora-prime-factorization-api-407a72eb","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://numomo.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_Ogc8cOER-AogQZmjC8JGI","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 complete prime factorization of a given integer, returning all prime factors and their exponents.","exampleAgentPrompt":"What is the prime factorization of 360? Break it down into all its prime factors with their exponents.","exampleUseCases":[{"title":"Cryptography key analysis","prompt":"Can you find the prime factorization of 8051? I need to check whether it breaks down into small primes for a cryptography exercise."},{"title":"Math homework prime decomposition","prompt":"What are all the prime factors of 2310 and how many times does each appear? Show me the full factorization."},{"title":"Checking if a number is prime","prompt":"Factorize 997 for me — I want to see if it has any prime factors other than itself."}],"resultDescription":"Returns a JSON object with a 'success' boolean, a 'computation' string describing what was computed, and a 'result' object containing the prime factors of the input integer along with their respective exponents or multiplicities.","failureModes":["Missing required field 'n' returns a validation error","Non-integer or float input may be rejected or produce unexpected results","Very large integers may time out or return errors depending on server limits","Negative integers or zero may be unsupported edge cases","Insufficient x402 micropayment balance causes a payment-required error"],"whenToPreferThis":"Choose this endpoint when you need a deterministic, server-side prime factorization of an integer without writing or executing local code. It is ideal for AI agents that need verified number-theoretic computations on demand, especially in math tutoring, cryptography analysis, or educational contexts. Prefer it over general-purpose code execution when you want a clean, structured JSON response with no setup overhead.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T18:57:14.725Z","isFirstParty":false}