number_theory
Compute exact integer facts for any size or expression: test primality, factor numbers, list divisors, calculate divisor sums and Euler phi, find previous/next primes, and convert digits across bases 2-36.
Instructions
Integer facts (any size, expressions ok): prime test, factorization, divisors, sigma, phi, prev/next prime, digits, bases 2-36.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"n": "<n>"
},
"name": "number_theory"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes | ||
| base | No | also show in base | |
| from_base | No | parse n in base |