{"uid":"cap_qetmreSbIFuKfe2SZ7idW","slug":"prime-factorization-api-1fb7a676","name":"Prime Factorization API","description":"Factorize a given number into its prime factors.","url":"https://sovereign-x402-zeta.vercel.app/api/v1/sequence/factorize?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","$schema":"https://json-schema.org/draft/2020-12/schema","required":["input"],"properties":{"input":{"type":"object","required":["type","method","bodyType","body"],"properties":{"body":{"type":"object","properties":{},"additionalProperties":true},"type":{"type":"string","const":"http"},"method":{"enum":["POST","PUT","PATCH"],"type":"string"},"bodyType":{"enum":["json","form-data","text"],"type":"string"}},"additionalProperties":false},"output":{"type":"object","required":["type"],"properties":{"type":{"type":"string"},"example":{"type":"object"}}}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.001","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.001/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_x3VsONCVNpbjcAZ7K7AiZ","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.001","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Decomposes a given integer into its prime factors via a paid HTTP endpoint.","exampleAgentPrompt":"Can you factorize 3600 into its prime factors for me?","exampleUseCases":[{"title":"Prime factorization for cryptography learning","prompt":"What are the prime factors of 2048? I'm studying RSA encryption and need to understand how numbers break down into primes."},{"title":"Math homework prime decomposition","prompt":"Can you break 720 down into its prime factors? I need to show the full prime factorization for my math assignment."},{"title":"Algorithm verification step","prompt":"Factorize 9999991 into its prime factors — I want to verify whether it's prime or a composite number before using it in my code."}],"resultDescription":"Returns the prime factorization of the input integer, typically as a list of prime numbers that multiply together to produce the original number (e.g., 360 → [2, 2, 2, 3, 3, 5]).","failureModes":["Non-integer or non-numeric input returns a validation error","Negative numbers or zero may not be supported and return an error","Very large numbers may time out or exceed computation limits","Missing required body field returns a 422 or 400 error","Payment failure or insufficient USDC balance returns a 402 error"],"whenToPreferThis":"Use this endpoint when you need on-demand prime factorization of integers without running local computation, especially in agentic workflows that already integrate x402 micropayments. Prefer this over local implementations when running in sandboxed environments without math libraries.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-11T00:41:47.097Z","isFirstParty":false,"canonicalSlug":"prime-factorization-api-1fb7a676"}