← All tools
// Number

Number Inspector online

Deep-inspect any integer — binary, hex, factors, prime check, and more

Number Inspector logo
by
CHUNKY
MUNSTER

How to Use the Number Inspector

  1. Type or paste an integer into the input field — positive or negative, up to about 16 digits.
  2. The result grid updates on every keystroke; no Inspect button click is needed.
  3. Each card has its own Copy button so you can grab the binary, hex or factorisation in one click.
  4. Click Inspect to force a refresh after pasting if the input field doesn't trigger an update.

The Number Inspector takes any integer and exposes fifteen properties at once: its decimal, binary, octal and hexadecimal representations, whether it is prime or composite, even or odd, the digit sum and digit count, the full divisor list and prime factorisation, the square and cube roots, a perfect-square test and the value in scientific notation. It's designed for the moment you're staring at an ID, a bitmask, a hash chunk or an exam-style question and want every angle on it without opening a calculator and a base-converter and a factoriser separately.

How the Number Inspector Works

Base conversions use the built-in Number.prototype.toString(radix) and are prefixed with 0b, 0o or 0x. The prime test is trial division up to √n, the divisor list pairs each i ≤ √n with n/i, and the prime factorisation pulls each smallest prime out repeatedly. All math runs on JavaScript double-precision Numbers, which means results are exact up to 2^53 − 1; above that, factor and divisor results become unreliable and the tool can't warn you, so keep inputs to about sixteen digits or fewer.

Frequently Asked Questions

How is the prime check performed?

The tool uses trial division: it returns false for n < 2, true for 2, false for any other even number, then tests odd divisors from 3 up to the square root of n. This is fast and exact for the integers JavaScript can represent precisely (up to 2^53).

What is the largest integer the inspector handles reliably?

It works on JavaScript Numbers, so anything up to Number.MAX_SAFE_INTEGER (9,007,199,254,740,991, or 2^53 − 1) is exact. Above that, parseInt loses precision and the divisor and factorisation results may be wrong, so stick to inputs of about 16 digits or fewer.

How are the divisors and prime factorisation calculated?

All divisors are found by iterating i from 1 to sqrt(n) and pairing each i with n/i. Prime factorisation uses trial division starting at 2, dividing out each prime fully before moving on, so 360 is reported as 2 × 2 × 2 × 3 × 3 × 5 with the exact multiplicities.

Why does the cube root of a negative input show a negative number while the square root does not?

Math.cbrt is defined for negative reals (cbrt(-8) = -2) so it is applied to the signed input. Math.sqrt of a negative is NaN, so the tool applies it to the absolute value and labels the row Square root accordingly.

Explore the full suite of Number tools and 290+ other free utilities at Chunky Munster.