What are the divisors of 506?

1, 2, 11, 22, 23, 46, 253, 506

4 even divisors

2, 22, 46, 506

4 odd divisors

1, 11, 23, 253

How to compute the divisors of 506?

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

  • 506 / 1 = 506 (the remainder is 0, so 1 is a divisor of 506)
  • 506 / 2 = 253 (the remainder is 0, so 2 is a divisor of 506)
  • 506 / 3 = 168.66666666667 (the remainder is 2, so 3 is not a divisor of 506)
  • ...
  • 506 / 505 = 1.0019801980198 (the remainder is 1, so 505 is not a divisor of 506)
  • 506 / 506 = 1 (the remainder is 0, so 506 is a divisor of 506)

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 506 (i.e. 22.494443758404). 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 )

  • 506 / 1 = 506 (the remainder is 0, so 1 and 506 are divisors of 506)
  • 506 / 2 = 253 (the remainder is 0, so 2 and 253 are divisors of 506)
  • 506 / 3 = 168.66666666667 (the remainder is 2, so 3 is not a divisor of 506)
  • ...
  • 506 / 21 = 24.095238095238 (the remainder is 2, so 21 is not a divisor of 506)
  • 506 / 22 = 23 (the remainder is 0, so 22 and 23 are divisors of 506)