Contribution and Reservation

(53·10²⁰¹+1)/9 =: 5(8)₂₀₀9_<202>; = 3 · 13 · 405683 · [372204778107909370496168562639181324213726360229911031891888866423170300828472356488073192988114244366046881804258869602992970252628655864680051052169183813842328002398796590320514172388665527397_<195>] SUBMIT/RESERVE

Status

Expression:	(53·10²⁰¹+1)/9
Composite Factor:	372204778107909370496168562639181324213726360229911031891888 866423170300828472356488073192988114244366046881804258869602 992970252628655864680051052169183813842328002398796590320514 172388665527397 (195-digit)
Status:	Not factored. Not reserved. You can submit its factors or reserve it for submitting in the future.

How to factor it

ECM, P-1, P+1

Look for prime factors by GMP-ECM first. Refer to the section "Efforts by ECM". Not only ECM but also P-1/P+1 may be helpful.

SNFS

Use GGNFS and/or Msieve if GMP-ECM cannot find a factor. The SNFS difficulty of this composite number is 203.93-digit and the GNFS difficulty is 194.57-digit. SNFS must be faster than GNFS. It will take about 26 CPU-days to factor this composite number on 64-bit Opteron-2600MHz.

Put factMsieve.pl to which $GGNFS_BIN_PATH and $NUM_CPUS were modified properly in the working directory 58889_201.
Put the following polynomial file 58889_201.poly in there too.
And then, run "perl factMsieve.pl 58889_201".

58889_201.poly ^*1

n: 372204778107909370496168562639181324213726360229911031891888866423170300828472356488073192988114244366046881804258869602992970252628655864680051052169183813842328002398796590320514172388665527397
m: 20000000000000000000000000000000000000000
deg: 5
c5: 265
c0: 16
skew: 0.57
type: snfs
lss: 1
rlim: 17500000
alim: 17500000
lpbr: 29
lpba: 29
mfbr: 56
mfba: 56
rlambda: 2.6
alambda: 2.6

*1 These parameters were not fully adjusted. The approximate expressions which were used for making the parameters are: deg=expt<=105?4:expt<=210?5:6 or expt<=144?4:6; d=log10(c[deg])+deg*log10(m)[digits]; time=10^(d/30-4)[hours]; skew=|c0/c[deg]|^(1/deg); rlim=round(7*10^(d/60+3)); lpbr=floor(d/25+21); mfbr=floor(d/8+31); rlambda=floor(d/25+18)/10;

Efforts by ECM

The efforts by ECM to find small factors of this 195-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 30-digit or more. Please report your efforts by ECM. (Anonymous reports are not acceptable)

Level	B1	Reported runs Total / Required runs (Required runs for lower level)	Name
30	25e4	0 / 0
35	1e6	118	Makoto Kamada	Apr 25, 2009
		118 / 904
		/ 786
40	3e6	0 / 2318 (280)
40	3e6	/ 2318 (280)
45	11e6	0 / 4475 (672)
45	11e6	/ 4475 (672)
50	43e6	0 / 7553 (1276)
50	43e6	/ 7553 (1276)

Command line to find prime factors up to about 35-digit

echo 372204778107909370496168562639181324213726360229911031891888866423170300828472356488073192988114244366046881804258869602992970252628655864680051052169183813842328002398796590320514172388665527397 | ecm -n -c 786 1e6

Command line to find prime factors up to about 40-digit

echo 372204778107909370496168562639181324213726360229911031891888866423170300828472356488073192988114244366046881804258869602992970252628655864680051052169183813842328002398796590320514172388665527397 | ecm -n -c 2318 3e6

Command line to find prime factors up to about 45-digit

echo 372204778107909370496168562639181324213726360229911031891888866423170300828472356488073192988114244366046881804258869602992970252628655864680051052169183813842328002398796590320514172388665527397 | ecm -n -c 4475 11e6

Command line to find prime factors up to about 50-digit

echo 372204778107909370496168562639181324213726360229911031891888866423170300828472356488073192988114244366046881804258869602992970252628655864680051052169183813842328002398796590320514172388665527397 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers