Math & Numbers

Perfect Number Checker

σ(n) = 2n ⟺ perfect. Factorization-based σ(n), proper-divisor sum, deficient/perfect/abundant classification, abundancy index, Euclid–Euler form. n ≤ 10¹².

text· Text resultOpen tool

Quick start

Call this tool from your code in three languages.

cURL

curl -X POST 'https://api.elysiatools.com/en/api/tools/perfect-number-checker' \
  -H 'Content-Type: application/json' \
  -d '{"n":"28","detail":"divisors"}'

API reference

Send a POST request with your inputs as JSON. File parameters require a separate upload first.

Endpoint

HTTP

POST https://api.elysiatools.com/en/api/tools/perfect-number-checker

Parameters

Name	Type	Required	Description
n	text	Yes	1 ≤ n ≤ 10¹² (trial-division factorization bound).
detail	select	Yes	—

Response format

Text result

JSON

{
  "result": "Processed text content",
  "error": "Error message (optional)",
  "message": "Notification message (optional)",
  "metadata": {
    "key": "value"
  }
}

MCP integration

Add this tool to your Model Context Protocol server so AI agents can list and call it.

Server configuration

Add this block to your MCP client configuration:

mcp.json

{
  "mcpServers": {
    "elysiatools-perfect-number-checker": {
      "name": "perfect-number-checker",
      "description": "σ(n) = 2n ⟺ perfect. Factorization-based σ(n), proper-divisor sum, deficient/perfect/abundant classification, abundancy index, Euclid–Euler form. n ≤ 10¹².",
      "baseUrl": "https://api.elysiatools.com/mcp/sse?toolId=perfect-number-checker",
      "command": "",
      "args": [],
      "env": {},
      "isActive": true,
      "type": "sse"
    }
  }
}

List available tools

After connecting to the SSE endpoint, list the exposed tools:

tools/list

{
  "jsonrpc": "2.0",
  "id": 1,
  "method": "tools/list"
}

Call this tool

Invoke the tool by its id, passing arguments built from its parameters:

tools/call

{
  "jsonrpc": "2.0",
  "id": 2,
  "method": "tools/call",
  "params": {
    "name": "perfect-number-checker",
    "arguments": {
  "n": "28",
  "detail": "divisors"
}
  }
}

Chain multiple tools in one session with a comma-separated toolId list, e.g. /mcp/sse?toolId=png-to-webp,jpg-to-webp,gif-to-webp (max 20).

Questions or issues? Contact [email protected]

Browse tools Open tool

Name

Type

Required

Description

text

Yes

1 ≤ n ≤ 10¹² (trial-division factorization bound).

detail

select

Yes

—

{ "mcpServers": { "elysiatools-perfect-number-checker": { "name": "perfect-number-checker", "description": "σ(n) = 2n ⟺ perfect. Factorization-based σ(n), proper-divisor sum, deficient/perfect/abundant classification, abundancy index, Euclid–Euler form. n ≤ 10¹².", "baseUrl": "https://api.elysiatools.com/mcp/sse?toolId=perfect-number-checker", "command": "", "args": [], "env": {}, "isActive": true, "type": "sse" } } }