{"uid":"cap_XHU7BNcFE6ua-oFLxARSP","slug":"numora-prime-factorization-api-207fe67c","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://numorapoi.orbonomy.xyz/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":"probe","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.03/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.03","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.03","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_1TGVYY1AB8W5QZ50yNrYE","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.03","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","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 its prime factors and their exponents","exampleAgentPrompt":"What is the prime factorization of 1260? Break it down into its prime factors with exponents.","exampleUseCases":null,"resultDescription":"Returns a JSON object with success=true, a result object containing the prime factors and their exponents for the given integer, and a human-readable computation string describing what was computed.","failureModes":["Non-integer input causes validation error","Missing required field 'n' returns error","Very large integers may exceed computation limits","Payment failure via x402 micropayment returns 402 status","Negative or zero input may return error or be undefined behavior"],"whenToPreferThis":"Use this endpoint when you need accurate, server-side prime factorization of an integer without implementing the algorithm yourself — especially useful in number theory workflows, cryptographic analysis helpers, educational tools, or math pipelines where you want zero local dependencies and pay-per-use pricing via x402 micropayments on Base.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T12:47:24.567Z","isFirstParty":false}