mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > enzocreti

Reply
 
Thread Tools
Old 2019-04-16, 10:23   #1
enzocreti
 
Mar 2018

21216 Posts
Default Number 99919

99919 is what a friend of mine has called super-brilliant number.


In fact, it has two prime factors of three digits each and sumdigits of the prime factors is the same




99919=163*613




two prime factors each with 3 digits, the sum of the digits of 163 is 10 and the sum of the digits of 613 is 10.


Is this the only number composed by two prime factors which is super-brilliant and the prime factors of it are a permutation of the digits of the other? In fact 613 is a permutation of the digits of 163...
Can you find other examples with two prime factors?
enzocreti is offline   Reply With Quote
Old 2019-04-16, 14:19   #2
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

467610 Posts
Default

Can't you make as many as you want by picking the prime factors first?

137x317= 43429 and many more.
petrw1 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Finding multiples of a real number that are close to a whole number mickfrancis Math 16 2017-03-01 07:17
Estimating the number of primes in a partially-factored number CRGreathouse Probability & Probabilistic Number Theory 15 2014-08-13 18:46
Number of distinct prime factors of a Double Mersenne number aketilander Operazione Doppi Mersennes 1 2012-11-09 21:16
Estimating the number of prime factors a number has henryzz Math 7 2012-05-23 01:13
Fermat number F6=18446744073709551617 is a composite number. Proof. literka Factoring 5 2012-01-30 12:28

All times are UTC. The time now is 04:48.


Sat Jul 17 04:48:10 UTC 2021 up 50 days, 2:35, 1 user, load averages: 1.66, 2.04, 2.13

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.