Contribution and Reservation

(10²³¹+53)/9 =: (1)₂₃₀7_<231>; = 3 · 13 · 59 · 9479 · [5094227648634267368632897428933626701752853942976265112083629734601284557387343027679114050235941445948937978598548529224903940823699219153220057985453748791439064853445616631320622838000234242775739500882144477889577226023_<223>] SUBMIT/RESERVE

Status

Expression:	(10²³¹+53)/9
Composite Factor:	509422764863426736863289742893362670175285394297626511208362 973460128455738734302767911405023594144594893797859854852922 490394082369921915322005798545374879143906485344561663132062 2838000234242775739500882144477889577226023 (223-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 231.90-digit and the GNFS difficulty is 222.71-digit. SNFS must be faster than GNFS. It will take about 224 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 11117_231.
Put the following polynomial file 11117_231.poly in there too.
And then, run "perl factMsieve.pl 11117_231".

11117_231.poly ^*1

n: 5094227648634267368632897428933626701752853942976265112083629734601284557387343027679114050235941445948937978598548529224903940823699219153220057985453748791439064853445616631320622838000234242775739500882144477889577226023
m: 200000000000000000000000000000000000000
deg: 6
c6: 125
c0: 424
skew: 1.23
type: snfs
lss: 1
rlim: 51000000
alim: 51000000
lpbr: 30
lpba: 30
mfbr: 59
mfba: 59
rlambda: 2.7
alambda: 2.7

*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 223-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 35-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
35	1e6	0 / 0
40	3e6	400	Serge Batalov	Feb 3, 2009
		400 / 2336
		/ 1936
45	11e6	0 / 4390 (561)
45	11e6	/ 4390 (561)
50	43e6	0 / 7538 (1252)
50	43e6	/ 7538 (1252)
55	11e7	0 / 17766 (3127)
55	11e7	/ 17766 (3127)

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

echo 5094227648634267368632897428933626701752853942976265112083629734601284557387343027679114050235941445948937978598548529224903940823699219153220057985453748791439064853445616631320622838000234242775739500882144477889577226023 | ecm -n -c 1936 3e6

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

echo 5094227648634267368632897428933626701752853942976265112083629734601284557387343027679114050235941445948937978598548529224903940823699219153220057985453748791439064853445616631320622838000234242775739500882144477889577226023 | ecm -n -c 4390 11e6

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

echo 5094227648634267368632897428933626701752853942976265112083629734601284557387343027679114050235941445948937978598548529224903940823699219153220057985453748791439064853445616631320622838000234242775739500882144477889577226023 | ecm -n -c 7538 43e6

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

echo 5094227648634267368632897428933626701752853942976265112083629734601284557387343027679114050235941445948937978598548529224903940823699219153220057985453748791439064853445616631320622838000234242775739500882144477889577226023 | ecm -n -c 17766 11e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers