Is prime
Checks if N is prime, finds previous and next primes. Feasible for N ≤ 10300.
Factorization
Prime factorization of N. Feasible for N ≤ 1040.
Primes ≤ N
Returns π(N) (count of primes ≤ N). Feasible for N ≤ 1011.
Max divisors ≤ N
Maximum d(M) among M in {1,…,N}. Feasible for N ≤ 10200.
Factorial N!
Exact N!. Here N ≤ 1,000.
Binomial C(N, K)
Exact C(N, K). Here N ≤ 1,000.
Arithmetic expression
Numeric literals, + - * / // %, powers with ** or ^, and one-arg sqrt, cbrt, log (base 10), log2, ln. No bitwise operators or other calls.
Base conversion
Read the number in the current base, then show it in the target base (bases 2–36; digits 0–9A–Z, case-insensitive).
Constants
Decimal forms with 40 digits after the decimal point.
-
π
3.1415926535897932384626433832795028841971
-
e
2.7182818284590452353602874713526624977572
-
φ
1.6180339887498948482045868343656381177203