Saylor Innovations Data Desk
Number toolkit - primality, prime factorization, divisors, totient, perfect or abundant class, roman numeral, English words, bases and gcd or lcm with a second number
The wallet the 402 directs payment to. Its whole payment record — every payer, every chain — is on the merchant page.
Asset 0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913
The payTo wallet does not resolve to a registered ERC-8004 agent. That is not a verdict on the service — most of the catalog is unregistered.
Accepts
The payment requirements as published to the catalog. Read the live 402 before paying — a price here is a claim, not a quote.
Pay 0.01 USDC on Base to 0xA2A8…fc8aa. The signed payment is good for 2 minutes.
- Paid to
- 0xA2A8…fc8aa
- USD Coin contract
- 0x8335…02913
- Payment window
- 2 minutes
- As published
- 10000 smallest units
The catalog’s raw entry
[
{
"asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
"extra": {
"memo": "saylor:datadesk:number-theory",
"name": "USD Coin",
"version": "2",
"facilitatorOnly": true,
"assetTransferMethod": "eip3009"
},
"payTo": "0xA2A8dF0f7CaaBEa4e120a2568118f141569fc8aa",
"amount": "10000",
"scheme": "exact",
"network": "eip155:8453",
"maxTimeoutSeconds": 120
}
]Extensions
{
"bazaar": {
"info": {
"input": {
"type": "http",
"method": "GET",
"queryParams": {
"m": "84",
"n": "360360"
}
},
"output": {
"type": "json",
"example": {
"n": 360360,
"note": "Primality uses deterministic Miller-Rabin (exact for numbers below 2^53); factorization is trial division up to 10^14. Pass m to also get gcd and lcm.",
"octal": "1277650",
"binary": "1010111111110101000",
"source": "number theory",
"with_m": {
"m": 84,
"gcd": 84,
"lcm": 360360,
"coprime": false
},
"is_even": true,
"in_words": "three hundred sixty thousand three hundred sixty",
"is_prime": false,
"digit_sum": 18,
"next_prime": 360391,
"aliquot_sum": 1212120,
"digit_count": 6,
"divisor_sum": 1572480,
"hexadecimal": "57FA8",
"digital_root": 9,
"divisor_count": 192,
"euler_totient": 69120,
"is_palindrome": false,
"prime_factors": [
2,
3,
5,
7,
11,
13
],
"roman_numeral": null,
"classification": "abundant",
"previous_prime": 360337,
"is_perfect_cube": false,
"is_power_of_two": false,
"is_perfect_square": false,
"prime_factorization": "2^3 x 3^2 x 5 x 7 x 11 x 13",
"distinct_prime_factors": 6
}
}
},
"schema": {
"type": "object",
"$schema": "https://json-schema.org/draft/2020-12/schema",
"required": [
"input"
],
"properties": {
"input": {
"type": "object",
"required": [
"type",
"method"
],
"properties": {
"type": {
"type": "string",
"const": "http"
},
"method": {
"enum": [
"GET",
"POST",
"PUT",
"PATCH",
"DELETE",
"HEAD"
],
"type": "string"
},
"queryParams": {
"type": "object",
"required": [
"n"
],
"properties": {
"m": {
"type": "string",
"description": "optional second number for gcd and lcm"
},
"n": {
"type": "string",
"description": "Whole number 0 to 9007199254740991"
}
}
}
},
"additionalProperties": false
},
"output": {
"type": "object",
"required": [
"type"
],
"properties": {
"type": {
"type": "string",
"const": "json"
},
"example": {
"type": "object",
"required": [
"n",
"is_prime",
"in_words"
],
"properties": {
"n": {
"type": "number",
"description": "The integer analysed"
},
"note": {
"type": "string",
"description": "Caveat or context for reading the result"
},
"octal": {
"type": [
"string",
"null"
],
"description": "Octal representation"
},
"binary": {
"type": "string",
"description": "Binary representation"
},
"source": {
"type": "string",
"description": "Data source the values come from"
},
"with_m": {
"type": "object",
"properties": {
"m": {
"type": [
"number",
"null"
],
"description": "Second number supplied"
},
"gcd": {
"type": [
"number",
"null"
],
"description": "Greatest common divisor with m"
},
"lcm": {
"type": [
"number",
"null"
],
"description": "Least common multiple with m"
},
"coprime": {
"type": [
"boolean",
"null"
],
"description": "True when n and m share no factor"
}
},
"description": "With m"
},
"is_even": {
"type": [
"boolean",
"null"
],
"description": "True when this is even"
},
"in_words": {
"type": "string",
"description": "In words"
},
"is_prime": {
"type": "boolean",
"description": "True when this is prime"
},
"digit_sum": {
"type": "number",
"description": "Digit sum"
},
"next_prime": {
"type": [
"number",
"null"
],
"description": "Next prime"
},
"aliquot_sum": {
"type": [
"number",
"null"
],
"description": "Aliquot sum"
},
"digit_count": {
"type": [
"number",
"null"
],
"description": "Number of digit"
},
"divisor_sum": {
"type": [
"number",
"null"
],
"description": "Divisor sum"
},
"hexadecimal": {
"type": "string",
"description": "Hexadecimal representation"
},
"digital_root": {
"type": [
"number",
"null"
],
"description": "Digital root"
},
"divisor_count": {
"type": [
"number",
"null"
],
"description": "Number of divisor"
},
"euler_totient": {
"type": [
"number",
"null"
],
"description": "Euler totient"
},
"is_palindrome": {
"type": [
"boolean",
"null"
],
"description": "True when this is palindrome"
},
"prime_factors": {
"type": [
"array",
"null"
],
"description": "Prime factors"
},
"roman_numeral": {
"type": [
"string",
"null"
],
"description": "Roman numeral"
},
"classification": {
"type": [
"string",
"null"
],
"description": "Classification assigned by the source"
},
"previous_prime": {
"type": [
"number",
"null"
],
"description": "Previous prime"
},
"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_perfect_square": {
"type": "boolean",
"description": "True when this is perfect square"
},
"prime_factorization": {
"type": [
"string",
"null"
],
"description": "Prime factorization"
},
"distinct_prime_factors": {
"type": [
"number",
"null"
],
"description": "Distinct prime factors"
}
}
}
}
}
}
}
}
}Provenance
- Seen in the source catalog
- 2026-10-18 02:51Z
- Last indexed by Roundhouse
- 2026-10-26 21:16Z
- Last enriched (probe, favicon, geo)
- 2026-10-18 11:15Z
- x402 version
- 2
- Max timeout
- 120s
- Liveness probe
- HTTP 404
Hand this page to an agent
Copy the prompt and paste it into Claude, an MCP client or your own agent — it will vet this service and call it over the free read API. No key, no account.
GET api.roundhouseai.io/v0/endpoints
This endpoint's own trailing-30-day call count, as published by the upstream catalog and snapshotted daily. 21 snapshots so far. Verified volume counts only settlements with an on-chain EIP-3009 marker.
Show the promptHide the prompt
Using Roundhouse, look up the x402 service Saylor Innovations Data Desk and tell me whether it is worth paying: what a call costs, whether the endpoint answered when last probed, and what its payment record actually shows. curl -s 'https://api.roundhouseai.io/v0/endpoints?q=Saylor%20Innovations%20Data%20Desk' curl -s 'https://api.roundhouseai.io/v0/merchants/<the payTo wallet returned above>' Then call it: read the price from the live 402 at https://saylorinnovations.com/api/math/number-theory, never from a cached figure, and pay with an x402 client. The /v0 API needs an API key (`authorization: Bearer rh_live_…`) on everything except /v0/unified* and /v0/endpoints. Either pay over x402 (mint a personal key for $0.01 at GET https://api.roundhouseai.io/v0/test/x402), or ask me for an organization key, which I create at https://roundhouseai.io/dashboard/connections. If you have neither, ask before going further. If you do not have Roundhouse tools or skills installed, read https://roundhouseai.io/skill.md first — it is the whole procedure.