C · No factor known
Enter a value, an expression, or a term with a variable like 10^n+1 to list a range.
Switch to Database id to look a number up by its stored id.
Reading never stores anything; use Create to add a number to the database.
See the expression syntax & functions reference.
Is factor of
SNFS polynomial degree 6 · difficulty 169.7
Special form: 10990^42-10990^35+10990^28-10990^21+109…. This number divides it, so the number field sieve can use a polynomial with small coefficients. The best one costs about as much as GNFS on a 125-digit number (this number has 168 digits). Listed best first; the files carry sieving parameters for the polynomial's difficulty.
x6 − 76930x4 + 1690921400x2 − 9291613093000 root m = −Y0/Y1
difficulty 169.7 · E 1.80e-11
ggnfs msieve cado
120780100x5 − 1327373299000x4 + 14587832556010000x3 − 160320279790549900000x2 + 17619198…0000<25>x − 19363499…9999<29>
difficulty 169.7 · E 5.58e-13
ggnfs msieve cado
n: 267569653122547454817002472675080055142475748840846054401170498001469859533714226801545513830472525708938474363387602458901374977191047887219722940985707256365599035533 # 10990^42-10990^35+10990^28-10990^21+10990^14-10990^7+1, difficulty: 169.72, scaled difficulty: 170.83 # special-q on the algebraic side, siever gnfs-lasieve4I13e, start at q = 3500000 in ranges of 4000 type: snfs size: 169 skew: 1.0000 c6: 1 c5: -1 c4: 1 c3: -1 c2: 1 c1: -1 c0: 1 Y1: 1 Y0: -19363499425130595976990000000 rlim: 7000000 alim: 7000000 lpbr: 27 lpba: 27 mfbr: 54 mfba: 54 rlambda: 2.5 alambda: 2.5
The block above is a GGNFS / yafu job file for the first polynomial (yafu: save it as
nfs.job and resume with -R).
The order is for a sieve of this job's size. E is the Murphy score with the conventional fixed parameters, comparable with msieve's; it favours low degrees for small jobs, so it is not always descending.Trial factoring & ECM effort 0
Work the background scanners have done on this number, from its position in the scanner queue.
Trial division
none yet
ECM effort
none yet
starts after trial division
Report factors
Paste anything - plain factors, a GMP-ECM run, a factor list. Every number found is checked for divisibility here; the ones that divide are submitted.
From the command linefdb · curl
fdb
fdb number id:1100000010047155141 --detail 2
curl
curl -s 'https://factordb.com:4059/rpc' -H 'Content-Type: application/json' -d '{"jsonrpc":"2.0","id":1,"method":"get_number","params":{"target":{"id":1100000010047155141},"decimal":false,"detail":2}}'