What are the divisors of 4643?

1, 4643

2 odd divisors

1, 4643

How to compute the divisors of 4643?

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

  • 4643 / 1 = 4643 (the remainder is 0, so 1 is a divisor of 4643)
  • 4643 / 2 = 2321.5 (the remainder is 1, so 2 is not a divisor of 4643)
  • 4643 / 3 = 1547.6666666667 (the remainder is 2, so 3 is not a divisor of 4643)
  • ...
  • 4643 / 4642 = 1.000215424386 (the remainder is 1, so 4642 is not a divisor of 4643)
  • 4643 / 4643 = 1 (the remainder is 0, so 4643 is a divisor of 4643)

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 4643 (i.e. 68.139562663698). 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 )

  • 4643 / 1 = 4643 (the remainder is 0, so 1 and 4643 are divisors of 4643)
  • 4643 / 2 = 2321.5 (the remainder is 1, so 2 is not a divisor of 4643)
  • 4643 / 3 = 1547.6666666667 (the remainder is 2, so 3 is not a divisor of 4643)
  • ...
  • 4643 / 67 = 69.298507462687 (the remainder is 20, so 67 is not a divisor of 4643)
  • 4643 / 68 = 68.279411764706 (the remainder is 19, so 68 is not a divisor of 4643)