Reference · stzNumber
Factors()
FACTORS The factors (divisors) of the integer number, as a list.
also written: Dividors · Divirdos · Divisors
Basic examples (2)
Softanza
? Q(25).LCM(42) ? @@( Q(1050).PrimeFactorsXT() ) + NL ? @@( Q(1050).FactorsXT() )
Output
1050 [ [ 2, 525 ], [ 3, 350 ], [ 5, 210 ], [ 7, 150 ] ] [ [ 1, 1050 ], [ 2, 525 ], [ 3, 350 ], [ 5, 210 ], [ 6, 175 ], [ 7, 150 ], [ 10, 105 ], [ 14, 75 ], [ 15, 70 ], [ 21, 50 ], [ 25, 42 ], [ 30, 35 ], [ 35, 30 ], [ 42, 25 ], [ 50, 21 ], [ 70, 15 ], [ 75, 14 ], [ 105, 10 ], [ 150, 7 ], [ 175, 6 ], [ 210, 5 ], [ 350, 3 ], [ 525, 2 ], [ 1050, 1 ] ]
run on 2026-10-02 04:23 inside the library at commit 0e72e2e2c; taken from 32_lcm.ring(opens in a new tab)
Softanza
? Q(169).IsPrime() ? Q(17).IsPrime() ? @@( Q(54).Divirdos() ) + NL # Misspelled, but works! ? @@( Q(54).Factors() ) + NL ? @@( Q(54).PrimeFactors() ) + NL ? @@( Q(54).PrimeDividors() )
Output
0 1 [ 1, 2, 3, 6, 9, 18, 27, 54 ] [ 1, 2, 3, 6, 9, 18, 27, 54 ] [ 2, 3 ] [ 2, 3 ]
run on 2026-10-02 04:23 inside the library at commit 0e72e2e2c; taken from 05_isprime.ring(opens in a new tab)
The extensions of this method
Each extension, and whether it exists for this method; an extension that exists combines with the others (FindSTCS).
Extension
Exists
What it adds · The names
Q
yes
does what the method does, then returns the object, so the call can be chained · FactorsQ
QQ
no
chains on the next, more specific type of object (the Q ladder)
QQQ
no
chains on the most specific type of object (the Q ladder)
QRT
yes
returns the result as an object of the requested type · FactorsQRT, FactorsXTQRT
CS
no
takes a case-sensitivity flag
ST
no
takes the position to start from (StartingAt)
IB
no
takes bounds that are included (IncludingBounds)
XT
yes
the extended form: more parameters than the base method · FactorsXT, DividorsXT, DivirdosXT, DivisorsXT and 1 more
XTT
no
yet another extension: a further extended form, after XT
Z
no
includes the position in what it returns
ZZ
no
returns positions as sections, [start, end]
W
no
selects by a condition
WF
no
selects by a condition, with the expressive keywords (@NextItem, @PreviousItem...)
D
no
takes a direction, forward or backward (Directional)
F
no
takes a function (the condition or the update is given as a function); the forms document also uses F for the future form, which defers the action
Many
no
works on a collection of items instead of one (the plural form)
Except
no
takes exceptions, what to leave out (the exceptional form)
U
no
returns the result without duplication
Every example is a test file of the library, run inside the library for this page; only those whose output kept every promise their file wrote are shown.
See also
- The class stzNumber
- The area's reference: Numeric & optimization
- The other methods in these examples: stzNumber.IsPrime · stzNumber.LeastCommonMultiple · stzNumber.PrimeFactors
- How-to: Get all the factors (divisors) of a number

