What are the divisors of 4784?

1, 2, 4, 8, 13, 16, 23, 26, 46, 52, 92, 104, 184, 208, 299, 368, 598, 1196, 2392, 4784

16 even divisors

2, 4, 8, 16, 26, 46, 52, 92, 104, 184, 208, 368, 598, 1196, 2392, 4784

4 odd divisors

1, 13, 23, 299

How to compute the divisors of 4784?

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 4784 by each of the numbers from 1 to 4784 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)

  • 4784 / 1 = 4784 (the remainder is 0, so 1 is a divisor of 4784)
  • 4784 / 2 = 2392 (the remainder is 0, so 2 is a divisor of 4784)
  • 4784 / 3 = 1594.6666666667 (the remainder is 2, so 3 is not a divisor of 4784)
  • ...
  • 4784 / 4783 = 1.0002090738031 (the remainder is 1, so 4783 is not a divisor of 4784)
  • 4784 / 4784 = 1 (the remainder is 0, so 4784 is a divisor of 4784)

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 4784 (i.e. 69.166465863162). 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 )

  • 4784 / 1 = 4784 (the remainder is 0, so 1 and 4784 are divisors of 4784)
  • 4784 / 2 = 2392 (the remainder is 0, so 2 and 2392 are divisors of 4784)
  • 4784 / 3 = 1594.6666666667 (the remainder is 2, so 3 is not a divisor of 4784)
  • ...
  • 4784 / 68 = 70.352941176471 (the remainder is 24, so 68 is not a divisor of 4784)
  • 4784 / 69 = 69.333333333333 (the remainder is 23, so 69 is not a divisor of 4784)