Contribution and Reservation

(64·10²³⁷+53)/9 =: 7(1)₂₃₆7_<238>; = 11 · 151 · 9133 · 35239969361_<11> · [13302058464722362133263819094487088075252740550069285318771625339927231480355975189008691046292666895777521794121672268091110793414905458908594395277648524518928693755425680809804741643460813000100060245469629260676026469_<221>] SUBMIT/RESERVE

Status

Expression:	(64·10²³⁷+53)/9
Composite Factor:	133020584647223621332638190944870880752527405500692853187716 253399272314803559751890086910462926668957775217941216722680 911107934149054589085943952776485245189286937554256808098047 41643460813000100060245469629260676026469 (221-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 239.71-digit and the GNFS difficulty is 220.12-digit. SNFS must be faster than GNFS. It will take about 407 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 71117_237.
Put the following polynomial file 71117_237.poly in there too.
And then, run "perl factMsieve.pl 71117_237".

71117_237.poly ^*1

n: 13302058464722362133263819094487088075252740550069285318771625339927231480355975189008691046292666895777521794121672268091110793414905458908594395277648524518928693755425680809804741643460813000100060245469629260676026469
m: 4000000000000000000000000000000000000000
deg: 6
c6: 125
c0: 424
skew: 1.23
type: snfs
lss: 1
rlim: 69000000
alim: 69000000
lpbr: 30
lpba: 30
mfbr: 60
mfba: 60
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 221-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 20-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
20	11e3	74	Max Dettweiler	Mar 6, 2009
20	11e3	74 / 74
25	5e4	0 / 204
25	5e4	/ 204
30	25e4	0 / 430 (48)
30	25e4	/ 430 (48)
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 25-digit

echo 13302058464722362133263819094487088075252740550069285318771625339927231480355975189008691046292666895777521794121672268091110793414905458908594395277648524518928693755425680809804741643460813000100060245469629260676026469 | ecm -n -c 204 5e4

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

echo 13302058464722362133263819094487088075252740550069285318771625339927231480355975189008691046292666895777521794121672268091110793414905458908594395277648524518928693755425680809804741643460813000100060245469629260676026469 | ecm -n -c 430 25e4

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

echo 13302058464722362133263819094487088075252740550069285318771625339927231480355975189008691046292666895777521794121672268091110793414905458908594395277648524518928693755425680809804741643460813000100060245469629260676026469 | ecm -n -c 904 1e6

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

echo 13302058464722362133263819094487088075252740550069285318771625339927231480355975189008691046292666895777521794121672268091110793414905458908594395277648524518928693755425680809804741643460813000100060245469629260676026469 | ecm -n -c 2350 3e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers