Find the number of ways to express 1050 as sum of consecutive integers I have to solve this task: 

Find the number of ways to present $1050$ as sum of consecutive
positive integers.

I was thinking if factorization can help there:
$$1050 = 2 \cdot  3 \cdot  5^2 \cdot  7 $$
but I am not sure how to use that information (if there is a sense)
example
I can solve something similar but on smaller scale:
\begin{align} 15 &= 15  \\ &= 7+8 \\ &=4+5+6 \\ &= 1+2+3+4+5 \end{align}
($4$ ways)

Using the MiniZinc solver with Gecode, I got the following $12$ solutions:
13 .. 47
24 .. 51
30 .. 54
40 .. 60
43 .. 62
63 .. 77
82 .. 93
147 .. 153
208 .. 212
261 .. 264
349 .. 351
1050 .. 1050

The model:
var 1..1050: k0;
var 0..1050: k1;

constraint
  (1050 == sum([k0 + k | k in 0..k1]));

solve satisfy;

output ["\n\(k0) .. \(k0+k1)"];

