document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=201989>Question 201989</A>: <I><SPAN STYLE=\"word-break: break-all;\"> What is the smallest composite number over 10,000 whose digits sum to the same value as the sum of the digits of its prime factorization? <BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #152250 by </B><A HREF=/tutors/aboutme.mpl?userid=RAY100><B>RAY100(1637)</B></A><img src=\"/images/stars/stars-12.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=RAY100><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/images/nopicture.jpg><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=152250\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Try  this,  assume  that  the  digits  are  the  same,<BR>\n" );
document.write( ".<BR>\n" );
document.write( "xx,xxx,,,,,or  x+x+x+x+x (Sum  of  Digits)<BR>\n" );
document.write( ".<BR>\n" );
document.write( "if  y = factor,,,,use  5  factors(somewhat  arbitrary),again  all  factors  same<BR>\n" );
document.write( ",<BR>\n" );
document.write( "As a  1st  est,,,5th  root  of  10000 = 6.3,, therefore  use  7<BR>\n" );
document.write( ",<BR>\n" );
document.write( "7^5 = 16,807,,,1+6+8+0+7 = 22  vs  5*7 =35<BR>\n" );
document.write( ",<BR>\n" );
document.write( "trying  8, 8^5 = 32768,,,,3+2+7+6+8=26, vs  5*8=40 <BR>\n" );
document.write( ".<BR>\n" );
document.write( "from  this  pattern  we  see  that  the  power  should  increase, and  the  base  degrease<BR>\n" );
document.write( ",<BR>\n" );
document.write( "following  this  pattern,  bring  us  to  3^9= 19683<BR>\n" );
document.write( "Sum  of  Digits  = 1+9+6+8+3 = 27,,,and  9*3 =27<BR>\n" );
document.write( ".<BR>\n" );
document.write( "Might  be  a  number  closer  to  10,000,  but  this  works </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );