What are the divisors of 4498?

1, 2, 13, 26, 173, 346, 2249, 4498

4 even divisors

2, 26, 346, 4498

4 odd divisors

1, 13, 173, 2249

How to compute the divisors of 4498?

A number N is said to be divisible by a number M (with M non-zero) if, when we divide N by M, the remainder of the division is zero.

N mod M = 0

Brute force algorithm

We could start by using a brute-force method which would involve dividing 4498 by each of the numbers from 1 to 4498 to determine which ones have a remainder equal to 0.

Remainder = N ( M × N M )

(where N M is the integer part of the quotient)

  • 4498 / 1 = 4498 (the remainder is 0, so 1 is a divisor of 4498)
  • 4498 / 2 = 2249 (the remainder is 0, so 2 is a divisor of 4498)
  • 4498 / 3 = 1499.3333333333 (the remainder is 1, so 3 is not a divisor of 4498)
  • ...
  • 4498 / 4497 = 1.0002223704692 (the remainder is 1, so 4497 is not a divisor of 4498)
  • 4498 / 4498 = 1 (the remainder is 0, so 4498 is a divisor of 4498)

Improved algorithm using square-root

However, there is another slightly better approach that reduces the number of iterations by testing only integers less than or equal to the square root of 4498 (i.e. 67.067130548429). Indeed, if a number N has a divisor D greater than its square root, then there is necessarily a smaller divisor d such that:

D × d = N

(thus, if N D = d , then N d = D )

  • 4498 / 1 = 4498 (the remainder is 0, so 1 and 4498 are divisors of 4498)
  • 4498 / 2 = 2249 (the remainder is 0, so 2 and 2249 are divisors of 4498)
  • 4498 / 3 = 1499.3333333333 (the remainder is 1, so 3 is not a divisor of 4498)
  • ...
  • 4498 / 66 = 68.151515151515 (the remainder is 10, so 66 is not a divisor of 4498)
  • 4498 / 67 = 67.134328358209 (the remainder is 9, so 67 is not a divisor of 4498)