factordbrpc · fdb
Sign in
>
?

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.

C · No factor known
id #1100000002268425003 205 digits

Value

5592048939…67<205>
5592048939…67<205> partial
Show full digits Permalink ‹ prev prime next prime ›
Is factor of
SNFS polynomial degree 6 · difficulty 249.2

Special form: 15072^59-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 170-digit number (this number has 205 digits). Listed best first; the files carry sieving parameters for the polynomial's difficulty.

2x6 − 471 difficulty 249.2 · E 2.77e-13 ggnfs msieve cado
486x6 − 157 difficulty 248.7 · E 2.01e-13 ggnfs msieve cado
x6 − 15072 difficulty 250.7 · E 1.95e-13 ggnfs msieve cado
243x6 − 5024 difficulty 250.2 · E 1.41e-13 ggnfs msieve cado
x5 − 471 difficulty 249.2 · E 1.21e-13 ggnfs msieve cado
81x5 − 157 difficulty 248.7 · E 1.01e-13 ggnfs msieve cado 
n: 5592048939308746927359052281037923300051558877018148526330213960707133973004987843580523812007763817094069075538390165499164786242404655236645270669262402811135809995202431594568285172734664061729593458967
# 15072^59-1, difficulty: 249.19, scaled difficulty: 250.95
# special-q on the rational side, siever gnfs-lasieve4I14e, start at q = 29500000 in ranges of 32000
type: snfs
size: 249
skew: 2.4850
c6: 2
c0: -471
Y1: 1
Y0: -302467598952629593886700782672164486643712
rlim: 59000000
alim: 59000000
lpbr: 31
lpba: 31
mfbr: 62
mfba: 62
rlambda: 2.6
alambda: 2.6
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 11 · TF complete · 2 ECM stages

Work the background scanners have done on this number, from its position in the scanner queue.

Trial division up to 100G
ECM effort P-1 B1=500000 · P+1 c=3 B1=50000 next: ECM c=15 B1=150000

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:1100000002268425003 --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":1100000002268425003},"decimal":false,"detail":2}}'