What are the divisors of 163?

1, 163

2 odd divisors

1, 163

How to compute the divisors of 163?

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

  • 163 / 1 = 163 (the remainder is 0, so 1 is a divisor of 163)
  • 163 / 2 = 81.5 (the remainder is 1, so 2 is not a divisor of 163)
  • 163 / 3 = 54.333333333333 (the remainder is 1, so 3 is not a divisor of 163)
  • ...
  • 163 / 162 = 1.0061728395062 (the remainder is 1, so 162 is not a divisor of 163)
  • 163 / 163 = 1 (the remainder is 0, so 163 is a divisor of 163)

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 163 (i.e. 12.767145334804). 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 )

  • 163 / 1 = 163 (the remainder is 0, so 1 and 163 are divisors of 163)
  • 163 / 2 = 81.5 (the remainder is 1, so 2 is not a divisor of 163)
  • 163 / 3 = 54.333333333333 (the remainder is 1, so 3 is not a divisor of 163)
  • ...
  • 163 / 11 = 14.818181818182 (the remainder is 9, so 11 is not a divisor of 163)
  • 163 / 12 = 13.583333333333 (the remainder is 7, so 12 is not a divisor of 163)