API · x402

Number toolkit - primality, prime factorization, divisors, totient, perfect or abundant…

Number toolkit - primality, prime factorization, divisors, totient, perfect or abundant class, roman numeral, English words, bases and gcd or lcm with a second number

by Saylor Innovations Knowledge Base · verified provider · updated 2026-10-26

What it does

Number toolkit - primality, prime factorization, divisors, totient, perfect or abundant class, roman numeral, English words, bases and gcd or lcm with a second number

Tags: is this number prime · prime factorization of a number · number to roman numeral · number to english words · gcd and lcm of two numbers

Use with an agent

  1. Discover. Agents find this listing with GET https://bazaar.saylorinnovations.com/discovery/search?query=…, the MCP tool search_resources, or /discovery/resources.
  2. Inspect. Fetch /resources/saylorinnovations-api-math-number-theory.json for the price and payment options.
  3. Pay. Call GET https://saylorinnovations.com/api/math/number-theory. The provider answers 402 with its payment requirements. An x402 client signs one of the options below and retries with PAYMENT-SIGNATURE.
  4. Execute. The provider returns 200 with the data. Agent Bazaar is not in the request path and never sees your payment.

For humans

You don't need an account or an API key; you need a wallet holding a small amount of USDC or USDT or SOL on Base, Polygon, Arbitrum One, Solana, and an x402-capable client (see the examples below). Call the endpoint unpaid first to see exactly what it asks for.

Pricing & payment

Price
$0.01 / request
Protocol
x402 v2
Auth
No account or API key. Pay per request.
Networks
Base, Polygon, Arbitrum One, Solana

x402 payment requirements

SchemeNetworkAssetAmountPay toTimeout
exactBase
eip155:8453
USDC$0.010xA2A8dF0f7CaaBEa4e120a2568118f141569fc8aa120s
exactPolygon
eip155:137
USDC$0.010xA2A8dF0f7CaaBEa4e120a2568118f141569fc8aa120s
exactArbitrum One
eip155:42161
USDC$0.010xA2A8dF0f7CaaBEa4e120a2568118f141569fc8aa120s
exactSolana
solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp
USDC$0.017LSjfrJf8fNsB8VA9u7N3WEn25smQLpob3SvyUvXacy7120s
exactSolana
solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp
USDT$0.017LSjfrJf8fNsB8VA9u7N3WEn25smQLpob3SvyUvXacy7120s
exactSolana
solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp
SOL$0.017LSjfrJf8fNsB8VA9u7N3WEn25smQLpob3SvyUvXacy7120s
accepts[] (raw JSON)
[
  {
    "scheme": "exact",
    "network": "eip155:8453",
    "payTo": "0xA2A8dF0f7CaaBEa4e120a2568118f141569fc8aa",
    "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
    "amount": "10000",
    "amountUsd": 0.01,
    "maxTimeoutSeconds": 120
  },
  {
    "scheme": "exact",
    "network": "eip155:137",
    "payTo": "0xA2A8dF0f7CaaBEa4e120a2568118f141569fc8aa",
    "asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
    "amount": "10000",
    "amountUsd": 0.01,
    "maxTimeoutSeconds": 120
  },
  {
    "scheme": "exact",
    "network": "eip155:42161",
    "payTo": "0xA2A8dF0f7CaaBEa4e120a2568118f141569fc8aa",
    "asset": "0xaf88d065e77c8cC2239327C5EDb3A432268e5831",
    "amount": "10000",
    "amountUsd": 0.01,
    "maxTimeoutSeconds": 120
  },
  {
    "scheme": "exact",
    "network": "solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp",
    "payTo": "7LSjfrJf8fNsB8VA9u7N3WEn25smQLpob3SvyUvXacy7",
    "asset": "EPjFWdd5AufqSSqeM2qN1xzybapC8G4wEGGkZwyTDt1v",
    "amount": "10000",
    "amountUsd": 0.01,
    "maxTimeoutSeconds": 120
  },
  {
    "scheme": "exact",
    "network": "solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp",
    "payTo": "7LSjfrJf8fNsB8VA9u7N3WEn25smQLpob3SvyUvXacy7",
    "asset": "Es9vMFrzaCERmJfrF4H2FYD4KCoNkY11McCe8BenwNYB",
    "amount": "10000",
    "amountUsd": 0.01,
    "maxTimeoutSeconds": 120
  },
  {
    "scheme": "exact",
    "network": "solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp",
    "payTo": "7LSjfrJf8fNsB8VA9u7N3WEn25smQLpob3SvyUvXacy7",
    "asset": "So11111111111111111111111111111111111111112",
    "amount": "95830",
    "amountUsd": 0.01,
    "maxTimeoutSeconds": 120
  }
]

Schemas

Output schema (JSON Schema)
{
  "type": "object",
  "properties": {
    "n": {
      "type": "number",
      "description": "The integer analysed"
    },
    "is_prime": {
      "type": "boolean",
      "description": "True when this is prime"
    },
    "binary": {
      "type": "string",
      "description": "Binary representation"
    },
    "hexadecimal": {
      "type": "string",
      "description": "Hexadecimal representation"
    },
    "in_words": {
      "type": "string",
      "description": "In words"
    },
    "roman_numeral": {
      "type": [
        "string",
        "null"
      ],
      "description": "Roman numeral"
    },
    "digit_sum": {
      "type": "number",
      "description": "Digit sum"
    },
    "is_perfect_square": {
      "type": "boolean",
      "description": "True when this is perfect square"
    },
    "next_prime": {
      "type": [
        "number",
        "null"
      ],
      "description": "Next prime"
    },
    "note": {
      "type": "string",
      "description": "Caveat or context for reading the result"
    },
    "source": {
      "type": "string",
      "description": "Data source the values come from"
    },
    "octal": {
      "description": "Octal representation",
      "type": [
        "string",
        "null"
      ]
    },
    "with_m": {
      "type": "object",
      "properties": {
        "m": {
          "description": "Second number supplied",
          "type": [
            "number",
            "null"
          ]
        },
        "gcd": {
          "description": "Greatest common divisor with m",
          "type": [
            "number",
            "null"
          ]
        },
        "lcm": {
          "description": "Least common multiple with m",
          "type": [
            "number",
            "null"
          ]
        },
        "coprime": {
          "description": "True when n and m share no factor",
          "type": [
            "boolean",
            "null"
          ]
        }
      },
      "description": "With m"
    },
    "is_even": {
      "type": [
        "boolean",
        "null"
      ],
      "description": "True when this is even"
    },
    "digit_count": {
      "type": [
        "number",
        "null"
      ],
      "description": "Number of digit"
    },
    "digital_root": {
      "type": [
        "number",
        "null"
      ],
      "description": "Digital root"
    },
    "is_perfect_cube": {
      "type": [
        "boolean",
        "null"
      ],
      "description": "True when this is perfect cube"
    },
    "is_power_of_two": {
      "type": [
        "boolean",
        "null"
      ],
      "description": "True when this is power of two"
    },
    "is_palindrome": {
      "type": [
        "boolean",
        "null"
      ],
      "description": "True when this is palindrome"
    },
    "prime_factorization": {
      "type": [
        "string",
        "null"
      ],
      "description": "Prime factorization"
    },
    "prime_factors": {
      "type": [
        "array",
        "null"
      ],
      "description": "Prime factors"
    },
    "distinct_prime_factors": {
      "type": [
        "number",
        "null"
      ],
      "description": "Distinct prime factors"
    },
    "divisor_count": {
      "type": [
        "number",
        "null"
      ],
      "description": "Number of divisor"
    },
    "divisor_sum": {
      "type": [
        "number",
        "null"
      ],
      "description": "Divisor sum"
    },
    "aliquot_sum": {
      "type": [
        "number",
        "null"
      ],
      "description": "Aliquot sum"
    },
    "classification": {
      "type": [
        "string",
        "null"
      ],
      "description": "Classification assigned by the source"
    },
    "euler_totient": {
      "type": [
        "number",
        "null"
      ],
      "description": "Euler totient"
    },
    "previous_prime": {
      "type": [
        "number",
        "null"
      ],
      "description": "Previous prime"
    }
  },
  "required": [
    "n",
    "is_prime",
    "in_words"
  ]
}
Example shape — generated from the schema, not a captured live response
{
  "n": 0,
  "is_prime": true,
  "binary": "string",
  "hexadecimal": "string",
  "in_words": "string",
  "roman_numeral": "string",
  "digit_sum": 0,
  "is_perfect_square": true,
  "next_prime": 0,
  "note": "string",
  "source": "string",
  "octal": "string",
  "with_m": {
    "m": 0,
    "gcd": 0,
    "lcm": 0,
    "coprime": true
  },
  "is_even": true,
  "digit_count": 0,
  "digital_root": 0,
  "is_perfect_cube": true,
  "is_power_of_two": true,
  "is_palindrome": true,
  "prime_factorization": "string",
  "prime_factors": [
    "value"
  ],
  "distinct_prime_factors": 0,
  "divisor_count": 0,
  "divisor_sum": 0,
  "aliquot_sum": 0,
  "classification": "string",
  "euler_totient": 0,
  "previous_prime": 0
}

Examples

curl
curl "https://saylorinnovations.com/api/math/number-theory"
# -> 402 Payment Required, accepts[] lists how to pay
# retry with a PAYMENT-SIGNATURE (or PAYMENT header) once paid
JavaScript
const res = await fetch("https://saylorinnovations.com/api/math/number-theory");
if (res.status === 402) {
  const { accepts } = await res.json();
  // pay one of accepts[] via an x402 client, then retry with the payment header
}
Python
import httpx
res = httpx.get("https://saylorinnovations.com/api/math/number-theory")
if res.status_code == 402:
    accepts = res.json()["accepts"]
    # pay one of accepts[] via an x402 client, then retry with the payment header

Details

Provider
Saylor Innovations Knowledge Base
Endpoint
https://saylorinnovations.com/api/math/number-theory
Side effects
Paid calls settle the advertised payment; see the provider contract for execution behavior.
Machine-readable
/resources/saylorinnovations-api-math-number-theory.json