{"uid":"cap_yzD3GDLgngYYyejseHNv8","slug":"x402-toolbox-prime-factorization-a12a77c8","name":"x402-toolbox Prime Factorization","description":"309 deterministic pay-per-call tools for AI agents over x402 (USDC, Base). No signup, no API key: the payment is the identity.","url":"https://x402-toolbox.shablony-pro.workers.dev/math/prime-factorization?utm_source=zero.xyz","method":"GET","headers":{},"bodySchema":{"type":"object","properties":{"schema":{"type":"string"}}},"responseSchema":{"type":"json","example":{"ok":true,"paid":true}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.002","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.002/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_v8-xtYVA57ZCw-k4xT4xJ","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.002","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Returns the prime factorization of a given integer, decomposing it into its prime factors","exampleAgentPrompt":"What is the prime factorization of 360? Break it down into all its prime factors.","exampleUseCases":[{"title":"Factorizing large integers for cryptography","prompt":"Can you give me the prime factorization of 1299709? I need to verify its primality and factor structure for a cryptographic exercise."},{"title":"Math homework prime factor check","prompt":"What are the prime factors of 2520? I'm trying to find the least common multiple for a math problem and need the full factorization."},{"title":"Checking if a number is prime","prompt":"Factorize 97 for me — I want to confirm whether it's prime or if it has any divisors other than itself and 1."}],"resultDescription":"A JSON response with ok and paid flags, plus the prime factorization of the input integer expressed as a list or map of prime factors (and their exponents), computed deterministically for any positive integer.","failureModes":["Non-integer or non-numeric input returns an error","Negative numbers or zero may not be supported","Very large integers beyond computational limits may time out or fail","Missing or malformed schema parameter returns a validation error","Payment failure (insufficient USDC balance) returns HTTP 402"],"whenToPreferThis":"Choose this endpoint when you need a quick, deterministic, pay-per-call prime factorization with no API key or signup required. It is ideal for AI agents that need math utilities on demand and can pay micro-amounts in USDC via the x402 protocol. Prefer it over general-purpose math APIs when you want trustless, anonymous, per-call billing.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-02T06:46:47.511Z","isFirstParty":false,"canonicalSlug":"x402-toolbox-prime-factorization-a12a77c8"}