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 #1100000004113236831 117 digits

Value

2582166216…47<117>
2582166216…47<117> partial
Show full digits Permalink ‹ prev prime next prime ›
Is factor of
SNFS polynomial degree 6 · difficulty 145.5

Special form: 10987^36-10987^33+10987^27-10987^24+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 112-digit number (this number has 117 digits). Listed best first; the files carry sieving parameters for the polynomial's difficulty.

x6 − x5 − 6x4 + 6x3 + 8x2 − 8x + 1 root m = −Y0/Y1 difficulty 145.5 · E 6.58e-10 ggnfs msieve cado 
n: 258216621637654560578101170672061698968246367293335807655854934601719147677642870412075809354024020640950118823694847
# 10987^36-10987^33+10987^27-10987^24+10987^18-10987^12+10987^9-10987^3+1, difficulty: 145.47, scaled difficulty: 147.38
# special-q on the algebraic side, siever gnfs-lasieve4I13e, start at q = 1860000 in ranges of 4000
type: snfs
size: 145
skew: 1.1547
c6: 1
c5: -1
c4: -6
c3: 6
c2: 8
c1: -8
c0: 1
Y1: 1326286574803
Y0: -1759036078502673714488810
rlim: 3720000
alim: 3720000
lpbr: 26
lpba: 26
mfbr: 52
mfba: 52
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 12 · TF complete · 3 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 · ECM c=15 B1=150000 next: ECM c=25 B1=250000

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