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.
Value
Special form: 13557^74+13557^37+1. 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 201-digit number (this number has 288 digits). Listed best first; the files carry sieving parameters for the polynomial's difficulty.
n: 310658685219797539107545583652311860684529216396375679261706092787388523164313090730922869918893932504835862014668146324873061717821191848390613005377680234729410855494635308688953932522146589300648426840297274101330927656142138145786162856135635541071011012458563322039087144510513038913 # 13557^74+13557^37+1, difficulty: 305.78, scaled difficulty: 305.81 # special-q on the algebraic side, siever gnfs-lasieve4I16e, start at q = 50000000 in ranges of 32000 type: snfs size: 305 skew: 0.0419 c6: 183792249 c3: 13557 c0: 1 Y1: 1 Y0: -38544565343099757739517247365485772722265829434001 rlim: 100000000 alim: 100000000 lpbr: 32 lpba: 32 mfbr: 64 mfba: 64 rlambda: 2.6 alambda: 2.6
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.Work the background scanners have done on this number, from its position in the scanner queue.
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.
fdb number id:1100000002246809007 --detail 2
curl -s 'https://factordb.com:4059/rpc' -H 'Content-Type: application/json' -d '{"jsonrpc":"2.0","id":1,"method":"get_number","params":{"target":{"id":1100000002246809007},"decimal":false,"detail":2}}'