{"uid":"cap_QCpeTbrAF2jjNWkpjBkMl","slug":"sindri-prime-factorization-api-1438a64b","name":"Sindri Prime Factorization API","description":"Prime factorization of an integer via trial division, returning the full list of prime factors (with repetition).","url":"https://x402.outpimp.com/primeFactorize","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"n":{"type":"number","description":"Integer to factorize (2 to 10^12)."}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.01","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.01/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.01","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.01","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_xGhvVsJ6mSCnjoEJn6sfy","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.01","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 an integer (2 to 10^12) via trial division, returning all prime factors with repetition.","exampleAgentPrompt":"Can you give me the full prime factorization of 720, including repeated factors?","exampleUseCases":[{"title":"Factorize a large integer","prompt":"What are all the prime factors of 999999937, including any repeats?"},{"title":"Educational math breakdown","prompt":"Can you break down 360 into its prime factors for me — I need to see every prime multiplied out, not just the unique ones?"},{"title":"Cryptography key analysis","prompt":"Factorize the number 1000000000007 into primes — I want to know exactly which primes multiply to give that value."}],"resultDescription":"A list of prime factors of the input integer n, with repetition (e.g. for 12, returns [2, 2, 3]), computed via trial division. The product of all returned factors equals n.","failureModes":["Input n is less than 2 or not an integer — invalid input error","Input n exceeds 10^12 — out-of-range error","Non-numeric input provided — type validation error","Payment not processed — 402 Payment Required response"],"whenToPreferThis":"Choose this endpoint when you need the complete prime factorization of a single integer up to 10^12, with all prime factors listed including duplicates. It uses trial division and is well-suited for numbers in this range. Prefer it over manual computation or general-purpose math APIs when you need a lightweight, pay-per-call factorization with a clean JSON response.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T12:32:59.044Z","isFirstParty":false}