{"slug":"saylorinnovations-com-api-math-number-theory-178316","title":"Number toolkit","host":"saylorinnovations.com","method":"GET","resource":"https://saylorinnovations.com/api/math/number-theory","category":"other","description":"Number toolkit - primality, prime factorization, divisors, totient, perfect or abundant class, roman numeral, English words, bases and gcd or lcm with a second number","price_listed":0.01,"price_asked":null,"state":"no_terms","state_label":"Answers HTTP 404 without x402 payment terms","checks_7d":1,"answered_7d":0,"latency_ms_median":null,"reported_calls_30d":1,"reported_payers_30d":1,"networks":["eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"badge":"unverified","paid_checks_7d":0,"paid_ok_7d":0,"example_input":{"method":"GET","queryParams":{"m":"84","n":"360360"},"type":"http"},"output_schema":{"$schema":"https://json-schema.org/draft/2020-12/schema","properties":{"input":{"additionalProperties":false,"properties":{"method":{"enum":["GET","POST","PUT","PATCH","DELETE","HEAD"],"type":"string"},"queryParams":{"properties":{"m":{"description":"optional second number for gcd and lcm","type":"string"},"n":{"description":"Whole number 0 to 9007199254740991","type":"string"}},"required":["n"],"type":"object"},"type":{"const":"http","type":"string"}},"required":["type","method"],"type":"object"},"output":{"properties":{"example":{"properties":{"aliquot_sum":{"description":"Aliquot sum","type":["number","null"]},"binary":{"type":"string"},"classification":{"description":"Classification assigned by the source","type":["string","null"]},"digit_count":{"description":"Number of digit","type":["number","null"]},"digit_sum":{"description":"Digit sum","type":"number"},"digital_root":{"description":"Digital root","type":["number","null"]},"distinct_prime_factors":{"description":"Distinct prime factors","type":["number","null"]},"divisor_count":{"description":"Number of divisor","type":["number","null"]},"divisor_sum":{"description":"Divisor sum","type":["number","null"]},"euler_totient":{"description":"Euler totient","type":["number","null"]},"hexadecimal":{"type":"string"},"in_words":{"description":"In words","type":"string"},"is_even":{"description":"True when this is even","type":["boolean","null"]},"is_palindrome":{"description":"True when this is palindrome","type":["boolean","null"]},"is_perfect_cube":{"description":"True when this is perfect cube","type":["boolean","null"]},"is_perfect_square":{"description":"True when this is perfect square","type":"boolean"},"is_power_of_two":{"description":"True when this is power of two","type":["boolean","null"]},"is_prime":{"description":"True when this is prime","type":"boolean"},"n":{"type":"number"},"next_prime":{"description":"Next prime","type":["number","null"]},"note":{"description":"Caveat or context for reading the result","type":"string"},"octal":{"type":["string","null"]},"previous_prime":{"description":"Previous prime","type":["number","null"]},"prime_factorization":{"description":"Prime factorization","type":["string","null"]},"prime_factors":{"description":"Prime factors","type":["array","null"]},"roman_numeral":{"description":"Roman numeral","type":["string","null"]},"source":{"description":"Data source the values come from","type":"string"},"with_m":{"description":"With m"}},"required":["n","is_prime","in_words"],"type":"object"},"type":{"const":"json","type":"string"}},"required":["type"],"type":"object"}},"required":["input"],"type":"object"},"history":[{"day":"2026-10-18","reachable":true,"status":404,"valid_402":false,"asked_usdc":null,"price_match":null,"latency_ms":291,"error":null}],"description_full":"Number toolkit - primality, prime factorization, divisors, totient, perfect or abundant class, roman numeral, English words, bases and gcd or lcm with a second number","last_updated":"2026-10-17T10:22:20.558Z","schemes":["exact"]}