Contribution and Reservation

(2·10¹⁹⁴+43)/9 =: (2)₁₉₃7_<194>; = 3 · 239 · 599 · 58569143780233_<14> · 1849056226165216886834180725538741_<34> · [477774003799284931757027533443930044058200204000675666012749694678436957568955126173252976787042882398355584631203659863078083498304434616973_<141>] (Makoto Kamada / GMP-ECM 5.0.3 B1=400000, sigma=3786358839 for P34) SUBMIT/RESERVE

Status

Expression:	(2·10¹⁹⁴+43)/9
Composite Factor:	477774003799284931757027533443930044058200204000675666012749 694678436957568955126173252976787042882398355584631203659863 078083498304434616973 (141-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 195.00-digit and the GNFS difficulty is 140.68-digit. SNFS must be faster than GNFS. It will take about 13 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 22227_194.
Put the following polynomial file 22227_194.poly in there too.
And then, run "perl factMsieve.pl 22227_194".

22227_194.poly ^*1

n: 477774003799284931757027533443930044058200204000675666012749694678436957568955126173252976787042882398355584631203659863078083498304434616973
m: 1000000000000000000000000000000000000000
deg: 5
c5: 1
c0: 215
skew: 2.93
type: snfs
lss: 1
rlim: 12400000
alim: 12400000
lpbr: 28
lpba: 28
mfbr: 55
mfba: 55
rlambda: 2.5
alambda: 2.5

*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 141-digit composite number are not reported yet. Please report your efforts by ECM. (Anonymous reports are not acceptable)

Level	B1	Reported runs Total / Required runs (Required runs for lower level)
20	11e3	0 / 74
20	11e3	/ 74
25	5e4	0 / 214 (21)
25	5e4	/ 214 (21)
30	25e4	0 / 430 (50)
30	25e4	/ 430 (50)
35	1e6	0 / 904 (118)
35	1e6	/ 904 (118)
40	3e6	0 / 2350 (322)
40	3e6	/ 2350 (322)

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

echo 477774003799284931757027533443930044058200204000675666012749694678436957568955126173252976787042882398355584631203659863078083498304434616973 | ecm -n -c 74 11e3

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

echo 477774003799284931757027533443930044058200204000675666012749694678436957568955126173252976787042882398355584631203659863078083498304434616973 | ecm -n -c 214 5e4

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

echo 477774003799284931757027533443930044058200204000675666012749694678436957568955126173252976787042882398355584631203659863078083498304434616973 | ecm -n -c 430 25e4

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

echo 477774003799284931757027533443930044058200204000675666012749694678436957568955126173252976787042882398355584631203659863078083498304434616973 | ecm -n -c 904 1e6

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

echo 477774003799284931757027533443930044058200204000675666012749694678436957568955126173252976787042882398355584631203659863078083498304434616973 | ecm -n -c 2350 3e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers