Is 43 a Prime Number?

43 is the fourteenth prime and the upper half of the twin pair with 41. Together with 37 it bookends a stretch where primes come unusually thickly, before a gap opens on the way to 47. And it is prime: exactly two divisors, 1 and 43, with nothing in between. Proving that takes almost no effort, beca...

YOUR NUMBER

WORTH TRYING

43 IS

PRIME

PRIME GAP TO NEXT

+4

Exactly two divisors, 1 and itself. Previous prime 41, next 47. Twin prime with 41.

Prime factorisation

43

Number of divisors

2

Sum of divisors

44

Totient φ(n)

42

Previous prime

41

Next prime

47

FACTOR BREAKDOWN

PRIME

POWER

CONTRIBUTES

43

1

43

STEPS

1

Trial-divide 43 by every prime up to √43 ≈ 6 — beyond that a factor would have a partner below it

2

No divisor found, so 43 has exactly two divisors: 1 and itself

3

Every prime above 3 sits next to a multiple of 6 — here 43 is 6 × 7 + 1

4

43 is PRIME

SIEVE OF ERATOSTHENES

READY — NOTHING CROSSED OUT YET99 LEFT1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001 is set aside — it is neither prime nor composite0 of 74 strikes

Two thousand years old and still the fastest way. Take the first uncrossed number, 2, and strike out every multiple of it. Move to the next survivor, 3, and repeat. Each pass can start at the square of its prime, because anything smaller was already struck by a smaller factor — which is why the passes get shorter and stop entirely once the prime exceeds √100. Whatever survives is prime. Your number 43 is outlined in gold.

HOW MANY PRIMES BELOW x — AND WHAT THE THEORY PREDICTS

10
4 vs 4
100
25 vs 22
1,000
168 vs 145
10,000
1,229 vs 1,086
100,000
9,592 vs 8,686

Actual count against x ÷ ln x. At x = 10 the estimate overshoots slightly; from 100 upward it runs low, and from 1,000 onward the gap narrows steadily — a ratio of 1.16 at a thousand down to 1.10 at a hundred thousand. That it tends to 1 at all is the Prime Number Theorem, and how slowly it does so is why the proof took a century to find.

Proved, not guessed. Primality here uses a deterministic Miller–Rabin test with a fixed witness set that is proven correct for every number this page accepts, so a result of PRIME is a proof rather than a probability. Ranges are sieved up to 200,000; single numbers are tested up to 4,503,599,627,370,495.

Live simulation · drawn to scale · updates as you type

Created with❤️byeaglecalculator.com

HOW TO USE

  1. 1

    The answer is already on screen: 43 is prime. Nothing needs typing — this page opens the calculator with 43 loaded.

  2. 2

    Read the STEPS panel to see why. It trial-divides by every prime up to √43 ≈ 6.56, finds nothing, and stops — checking further could only rediscover factor pairs already seen.

  3. 3

    Check the six tiles for the derived quantities — divisor count, divisor sum, Euler's totient and the primes either side. All of them come from the factorisation rather than from separate searches.

  4. 4

    Type a different number to carry on, or switch to RANGE to sieve a whole interval at once and see how the primes thin out as the numbers grow.

THE FORMULAS

Primeexactly two divisors: 1 and n
Trial division limittest primes up to √n only
Fundamental theoremn = p₁^a¹ × p₂^a² × … uniquely
Number of divisorsd(n) = Π (aᵢ + 1)
Sum of divisorsσ(n) = Π (pᵢ^(aᵢ+1) − 1)/(pᵢ − 1)
Euler totientφ(n) = n · Π (1 − 1/pᵢ)
Totient of a primeφ(p) = p − 1
Sieve pass startbegin each pass at p²
Prime Number Theoremπ(x) ≈ x ÷ ln x
Twin primesp and p + 2 both prime
Mersenne prime2^p − 1, with p itself prime
Perfect numberσ(n) − n = n

FREQUENTLY ASKED QUESTIONS

RELATED CALCULATORS

MORE NUMBER THEORY CALCULATORS

Was this calculator helpful?

Last updated: July 29, 2026 · Formula verified · Deterministic Miller–Rabin, so a result of PRIME is proven rather than probable · Eagle-eyed accuracy for every calculation.