divisor
In mathematics, a divisor of an integer n is an integer d such that n = d·q for some integer q. When working with positive divisors, d is taken to be a positive integer. In that sense, d is a divisor of n if and only if n mod d = 0. Every positive integer n has at least two positive divisors: 1 and n. Negative divisors exist as well, since if d is a divisor, so is -d, but positive divisors are typically the focus in elementary contexts.
Examples help illustrate the concept. The positive divisors of 28 are 1, 2, 4, 7, 14, and
Divisors are closely tied to prime factorization. If n has prime factorization n = p1^a1 p2^a2 ... pk^ak,