Contribution and Reservation

(4·10²⁴⁹-1)/3 =: 1(3)₂₄₉_<250>; = 6053 · 93479 · 194559763 · 5742410231_<10> · [2109146572492664200833189888679432741141410698175846645555481358572215317086928676198576012243208092477835642711625515904058473068213645330965596764323782869122075528121860707850933347072239125936470876584497400850618846603_<223>] SUBMIT/RESERVE

Status

Expression:	(4·10²⁴⁹-1)/3
Composite Factor:	210914657249266420083318988867943274114141069817584664555548 135857221531708692867619857601224320809247783564271162551590 405847306821364533096559676432378286912207552812186070785093 3347072239125936470876584497400850618846603 (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 249.90-digit and the GNFS difficulty is 222.32-digit. SNFS must be faster than GNFS. It will take about 891 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 13333_249.
Put the following polynomial file 13333_249.poly in there too.
And then, run "perl factMsieve.pl 13333_249".

13333_249.poly ^*1

n: 2109146572492664200833189888679432741141410698175846645555481358572215317086928676198576012243208092477835642711625515904058473068213645330965596764323782869122075528121860707850933347072239125936470876584497400850618846603
m: 200000000000000000000000000000000000000000
deg: 6
c6: 125
c0: -2
skew: 0.50
type: snfs
lss: 1
rlim: 102000000
alim: 102000000
lpbr: 30
lpba: 30
mfbr: 62
mfba: 62
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 40-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
40	3e6	0 / 0
45	11e6	700	Dmitry Domanov	Jul 11, 2009
		700 / 4479
		/ 3779
50	43e6	0 / 7396 (1078)
50	43e6	/ 7396 (1078)
55	11e7	0 / 17726 (3068)
55	11e7	/ 17726 (3068)
60	26e7	0 / 42006 (7625)
60	26e7	/ 42006 (7625)

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

echo 2109146572492664200833189888679432741141410698175846645555481358572215317086928676198576012243208092477835642711625515904058473068213645330965596764323782869122075528121860707850933347072239125936470876584497400850618846603 | ecm -n -c 3779 11e6

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

echo 2109146572492664200833189888679432741141410698175846645555481358572215317086928676198576012243208092477835642711625515904058473068213645330965596764323782869122075528121860707850933347072239125936470876584497400850618846603 | ecm -n -c 7396 43e6

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

echo 2109146572492664200833189888679432741141410698175846645555481358572215317086928676198576012243208092477835642711625515904058473068213645330965596764323782869122075528121860707850933347072239125936470876584497400850618846603 | ecm -n -c 17726 11e7

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

echo 2109146572492664200833189888679432741141410698175846645555481358572215317086928676198576012243208092477835642711625515904058473068213645330965596764323782869122075528121860707850933347072239125936470876584497400850618846603 | ecm -n -c 42006 26e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers