What are the divisors of 473?

1, 11, 43, 473

4 odd divisors

1, 11, 43, 473

How to compute the divisors of 473?

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

  • 473 / 1 = 473 (the remainder is 0, so 1 is a divisor of 473)
  • 473 / 2 = 236.5 (the remainder is 1, so 2 is not a divisor of 473)
  • 473 / 3 = 157.66666666667 (the remainder is 2, so 3 is not a divisor of 473)
  • ...
  • 473 / 472 = 1.0021186440678 (the remainder is 1, so 472 is not a divisor of 473)
  • 473 / 473 = 1 (the remainder is 0, so 473 is a divisor of 473)

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 473 (i.e. 21.748563170932). 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 )

  • 473 / 1 = 473 (the remainder is 0, so 1 and 473 are divisors of 473)
  • 473 / 2 = 236.5 (the remainder is 1, so 2 is not a divisor of 473)
  • 473 / 3 = 157.66666666667 (the remainder is 2, so 3 is not a divisor of 473)
  • ...
  • 473 / 20 = 23.65 (the remainder is 13, so 20 is not a divisor of 473)
  • 473 / 21 = 22.52380952381 (the remainder is 11, so 21 is not a divisor of 473)