Showing posts with label divisors. Show all posts
Showing posts with label divisors. Show all posts

Tuesday, 25 August 2026

When Sequences Overlap

I've written in previous posts about what I've called the Factors Sequence (with and without multiplicity) and the Divisors Sequence:


What I noticed about the number (28268) associated with my diurnal age today is that for the Factors Sequence with multiplicity and the Divisors Sequence both terminate where they began. Here is the Factors Sequence: 28268, 7067, 14134, 42402, 169608, 28268. Figure 1 shows a plot of the points with a logarithmic vertical axis.


Figure 1

Here is Divisors Sequence: 28268, 339216, 13568640, 106005, 1696080, 21201, 169608, 5427456, 390776832, 2035296, 28268. Figure 2 shows a plot of the points with a logarithmic vertical axis:


Figure 2

Closer inspection of both sequences shows that they share a common number apart from 28268. The number is 169608 and Figure 3 shows both plots on the same graph.


Figure 3: permalink

In the range up 40000, there are 1779 numbers with these two properties:
  • the factors sequence with multiplicity and the divisors sequence terminate where they started
  • the two sequences share a common member different from the start and end values
Here are the numbers (permalink) from 28000 to 40000:

28001, 28012, 28019, 28036, 28056, 28124, 28132, 28148, 28163, 28204, 28244, 28248, 28252, 28268, 28292, 28307, 28324, 28348, 28364, 28372, 28388, 28396, 28444, 28468, 28492, 28499, 28532, 28536, 28564, 28588, 28612, 28628, 28643, 28676, 28684, 28724, 28732, 28776, 28793, 28796, 28804, 28868, 28892, 28901, 28924, 28949, 28961, 28964, 28968, 28979, 28996, 29021, 29033, 29044, 29064, 29084, 29092, 29108, 29116, 29123, 29156, 29164, 29201, 29212, 29243, 29252, 29256, 29276, 29308, 29339, 29356, 29372, 29428, 29444, 29452, 29453, 29468, 29483, 29492, 29516, 29548, 29564, 29588, 29612, 29636, 29684, 29692, 29708, 29756, 29764, 29784, 29788, 29812, 29832, 29852, 29873, 29884, 29928, 29932, 29972, 30004, 30052, 30072, 30076, 30124, 30172, 30203, 30264, 30269, 30284, 30323, 30347, 30388, 30389, 30404, 30408, 30436, 30449, 30452, 30467, 30476, 30504, 30508, 30524, 30532, 30539, 30548, 30552, 30604, 30644, 30652, 30689, 30716, 30773, 30788, 30803, 30836, 30844, 30884, 30916, 30956, 30988, 31004, 31052, 31076, 31084, 31124, 31132, 31139, 31148, 31196, 31204, 31228, 31244, 31252, 31253, 31259, 31276, 31324, 31348, 31396, 31436, 31444, 31469, 31484, 31512, 31547, 31564, 31588, 31612, 31636, 31649, 31652, 31721, 31756, 31793, 31828, 31844, 31868, 31876, 31916, 31924, 31964, 31988, 31992, 31996, 32003, 32009, 32012, 32084, 32088, 32092, 32108, 32132, 32136, 32141, 32188, 32204, 32228, 32232, 32252, 32284, 32308, 32332, 32376, 32381, 32424, 32476, 32507, 32516, 32524, 32548, 32561, 32564, 32568, 32572, 32573, 32596, 32603, 32612, 32633, 32636, 32692, 32712, 32756, 32788, 32789, 32804, 32812, 32828, 32843, 32852, 32908, 32933, 32955, 32987, 32996, 33004, 33028, 33044, 33053, 33068, 33096, 33107, 33116, 33196, 33236, 33284, 33288, 33308, 33332, 33347, 33356, 33364, 33384, 33388, 33404, 33428, 33432, 33436, 33461, 33484, 33521, 33528, 33532, 33569, 33596, 33604, 33628, 33644, 33652, 33668, 33672, 33713, 33749, 33764, 33773, 33809, 33812, 33836, 33864, 33884, 33892, 33916, 33932, 33941, 33956, 33964, 33988, 34008, 34012, 34028, 34036, 34076, 34124, 34196, 34204, 34228, 34244, 34253, 34268, 34316, 34348, 34372, 34412, 34444, 34468, 34484, 34532, 34556, 34584, 34604, 34612, 34628, 34636, 34667, 34732, 34844, 34868, 34913, 34949, 34968, 34972, 34996, 35036, 35068, 35069, 35081, 35092, 35108, 35164, 35188, 35204, 35236, 35252, 35256, 35339, 35363, 35372, 35404, 35428, 35448, 35492, 35516, 35524, 35564, 35573, 35596, 35612, 35636, 35668, 35684, 35708, 35756, 35788, 35812, 35908, 35924, 35932, 35933, 35956, 35963, 35993, 36024, 36068, 36076, 36083, 36092, 36124, 36148, 36168, 36188, 36212, 36284, 36292, 36299, 36308, 36312, 36316, 36332, 36353, 36356, 36388, 36404, 36408, 36428, 36452, 36467, 36476, 36484, 36501, 36524, 36572, 36596, 36629, 36668, 36676, 36683, 36696, 36716, 36761, 36772, 36788, 36821, 36844, 36868, 36888, 36892, 36916, 36923, 36929, 36932, 36984, 36988, 37012, 37013, 37036, 37049, 37052, 37084, 37148, 37156, 37181, 37196, 37204, 37228, 37252, 37253, 37316, 37388, 37412, 37464, 37516, 37532, 37547, 37556, 37628, 37708, 37796, 37804, 37848, 37853, 37876, 37924, 37948, 37972, 38036, 38068, 38092, 38108, 38116, 38136, 38184, 38189, 38201, 38212, 38228, 38252, 38276, 38284, 38308, 38333, 38356, 38372, 38396, 38428, 38444, 38453, 38468, 38472, 38501, 38548, 38564, 38588, 38603, 38636, 38668, 38669, 38684, 38692, 38732, 38747, 38764, 38804, 38812, 38828, 38852, 38861, 38867, 38873, 38908, 38924, 38933, 39028, 39044, 39052, 39089, 39092, 39107, 39144, 39172, 39188, 39192, 39196, 39233, 39236, 39308, 39323, 39336, 39364, 39388, 39412, 39419, 39432, 39452, 39476, 39521, 39524, 39569, 39572, 39576, 39596, 39624, 39652, 39668, 39748, 39772, 39779, 39812, 39827, 39836, 39844, 39864, 39908, 39916, 39932, 39953, 39956, 39964, 39988, 39989

Wednesday, 29 July 2026

Persistent Tau Numbers

I got to thinking about tau numbers, those numbers that are divisible by their number of divisors, because it's relevant to my divisors sequence which arises when these rules are applied recursively to a positive integer. The rules for a number \(n\) are:

Let \(d\) be the number of divisors of \(n\)

  • if \(d \,| \,n \) then \( n \rightarrow d \, | \,n \)
  • if \( d \, \nmid \, n\) then \(n \rightarrow d \times n\)
  • if \(d\) is prime then:
    • if \(d\) is a \(4k+1 \) prime then \( d \rightarrow 2 \times d +1\)
    • if \(d\) is a \(4k+3 \) prime then \( d \rightarrow \dfrac {d -1}{2}\)
I'll get back to that sequence later but what interested me were those tau numbers that remain tau numbers after being divided by their number of digits. I got Gemini to investigate and the results revealed that there are 160 such numbers in the range from 1 to 40000 (permalink) and they are:

1, 2, 8, 12, 80, 96, 108, 240, 384, 640, 720, 864, 896, 1200, 1408, 1440, 1664, 1920, 2016, 2176, 2240, 2432, 2560, 2688, 2944, 3168, 3456, 3600, 3712, 3744, 3968, 4032, 4224, 4736, 4896, 4992, 5040, 5248, 5472, 5504, 6016, 6528, 6624, 6784, 7296, 7552, 7808, 7920, 8100, 8352, 8576, 8832, 8928, 9088, 9344, 9360, 10112, 10624, 10656, 10800, 11136, 11392, 11808, 11904, 12240, 12384, 12416, 12928, 13184, 13536, 13680, 13696, 13952, 14208, 14464, 15264, 15744, 16256, 16512, 16560, 16768, 16992, 17536, 17568, 17792, 17920, 18048, 19072, 19296, 19328, 20096, 20160, 20352, 20448, 20864, 20880, 21024, 21376, 22144, 22320, 22656, 22752, 22912, 23040, 23168, 23424, 23904, 24300, 24448, 24704, 25216, 25472, 25632, 25728, 26244, 26640, 27008, 27264, 27936, 28032, 28224, 28544, 29056, 29088, 29312, 29520, 29664, 29824, 30000, 30336, 30592, 30720, 30816, 30848, 30960, 31392, 31872, 32128, 32544, 32896, 33664, 33840, 34176, 34432, 34560, 34688, 35456, 35968, 36224, 36576, 37248, 37504, 37728, 38160, 38400, 38784, 39296, 39456, 39552, 39808

Most survive only one division but some go further and these are (in the given range):
  • \(80 \rightarrow 8 \rightarrow 2 \rightarrow 1 \)
  • \(96 \rightarrow 8 \rightarrow 2 \rightarrow 1 \)
  • \(240 \rightarrow 12 \rightarrow 2 \rightarrow 1 \)
  • \(2240 \rightarrow 80 \rightarrow 8 \rightarrow 2 \rightarrow 1 \)
  • \(3456 \rightarrow 108 \rightarrow 9 \rightarrow 3 \)
  • \(3600 \rightarrow 80 \rightarrow 8 \rightarrow 2 \rightarrow 1 \)
  • \(4032 \rightarrow 96 \rightarrow 8 \rightarrow 2 \rightarrow 1 \)
  • \(23040 \rightarrow 384 \rightarrow 24 \rightarrow 3 \)
  • \(30720 \rightarrow 640 \rightarrow 40 \rightarrow 5 \)
  • \(38400 \rightarrow 640 \rightarrow 40 \rightarrow 5 \)
I discussed the divisor sequence in my post titled Number's Divisors to Sequence Algorithm. Applied to 23040 (one of the numbers listed in the bullet points above), the sequence is very short indeed: 23040, 384, 24, 3, 1 Once the sequence reaches 3 then, because it is a \(4k+3\) prime, 3 becomes 1 and 1 has one divisor and so 1 times 1 or 1 divided by 1 is still 1.

Only 5.257% of the numbers up to 100,000 are tau numbers, so the divisors to sequence algorithm is strongly weighted toward multiplication. A composite number is about 19 times more likely to get multiplied than it is to get divided. The primes strike a balance because of the \(4k+1\) versus \(4k+3\) rule. The rule is actually not needed as primes always have two divisors. I introduced the prime rule because in the two factors to sequence algorithms (using prime factors with and without multiplicity), the primes have no prime factors.

What if instead of multiplying by the number of divisors, we simply added 1? It would be interesting to see what sort of sequence develops if we do this.

Saturday, 11 July 2026

Revisiting the Divisors Algorithm

 Figure 1 shows the Divisors Algorithm that I developed early this year (link):

Figure 1

Applied to the number associated with my diurnal age today, 28223, we get the following trajectory:

28223, 169338, 4064112, 365770080, 1016028, 54865512, 7900633728, 20574567, 864131814, 165913308288, 192029292, 41478327072, 64009764, 11521757520, 13716378, 987579216, 237019011840, 243846720, 81932497920, 108150897254400, 17882092800, 17381394201600, 5486551200, 8466900, 914425200, 2032056, 28223

Figure 2 shows the trajectory. Note that the sequence returns to its starting point.


Figure 2

The vertical scale is logarithmic and the maximum value reached is impressive. Not every number enters a loop that returns it to its starting point. 28222 has a trajectory that enters a loop but it does not return to its starting point. The loop is reached at a value that is twice that of the starting point: 56444 = 2 x 28222. The trajectory is:

28222, 225776, 4515520, 252869120, 1580432, 63217280, 493885, 7902160, 98777, 790216, 25286912, 1820657664, 6321728, 112888, 1806208, 56444, 677328, 27093120, 211665, 3386640, 42333, 338664, 10837248, 780281856, 4063968, 56444

Figure 3 shows the trajectory:


Figure 3

Other numbers may or may not enter a loop but we have to call a stop somewhere. 28237 is an example of such a number where we call a halt after 99 steps. The trajectory is as shown in Figure 4 and it seems to be heading for the stars but who knows?


Figure 4

Once again, this algorithm is base-independent and so the trajectories will be identical regardless of the number base used. The trend of the trajectory for all numbers is generally upwards because of the primes \(p \rightarrow 2p+1\) but the situation will be different if we modify the rule for the primes as shown below. 

\(\text{For } p \text{ prime:}\)$$ \begin{align} &p \rightarrow 2p+1 \text{ if } p \! \bmod 4 \equiv 1 \\ &p \rightarrow \frac{p-1}{2} \text{ if }  p \bmod 4 \equiv 3 \end{align}$$
It would be interesting to investigate the trajectories using this modification. If no primes are encountered then the trajectories of course will be identical (as is the case with 28237 mentioned earlier). Here is a permalink to an implementation of this modification for the cases of:
  • primes \(p\) as above and composites \(n\) with factors counted \( \textbf{with} \) multiplicity. If \(f\) is the number of factors then:
    • if \( n \bmod f \equiv 0 \) then \(n \rightarrow n/f\)
    • if \( n \bmod f \not\equiv 0 \) then \(n \rightarrow n\times f\)
  • primes as above and composites with factors counted \textbf{without}\) multiplicity. If \(f\) is the number of factors then:
    • if \( n \bmod f \equiv 0 \) then \(n \rightarrow n/f\)
    • if \( n \bmod f \not\equiv 0 \) then \(n \rightarrow n\times f\)
  • primes as above and composites with divisors counted. If \(d\) is the number of divisors then:
    • if \( n \bmod d \equiv 0 \) then \(n \rightarrow n/d\)
    • if \( n \bmod d \not\equiv 0 \) then \(n \rightarrow n\times d\)
Here is the output for the number 28224:

=========================================
 Trajectory Analysis for N = 28224 
=========================================

1. Rule: Number of Factors (With Multiplicity)
   Highest Value: 2328480
   Trajectory Length: 15 steps
   Full Path: [28224, 282240, 23520, 211680, 2328480, 194040, 21560, 3080, 18480, 2310, 462, 1848, 308, 77, 154, 462]
   >>> Loop Detected: The sequence loops back to 462
--------------------------------------------------

2. Rule: Number of Factors (Without Multiplicity)
   Highest Value: 28224
   Trajectory Length: 9 steps
   Full Path: [28224, 9408, 3136, 1568, 784, 392, 196, 98, 49, 49]
   >>> Loop Detected: The sequence loops back to 49
--------------------------------------------------

3. Rule: Total Number of Divisors
   Highest Value: 28224
   Trajectory Length: 12 steps
   Full Path: [28224, 448, 32, 192, 2688, 84, 7, 3, 1, 2, 5, 11, 5]
   >>> Loop Detected: The sequence loops back to 5
--------------------------------------------------

Monday, 13 April 2026

Divisors and Antidivisors: A Fresh Perspective

I've written about antidivisors before in posts titled Anti-Divisors and More on Anti-Divisors. Here is a fresh take. My diurnal age today is 28134 and the antidivisors of this number are 4, 12, 36, 108, 2084, 6252 and 18756. If we concatenate these numbers from left to right we get a rather large number (412361082084625218756) with the property that:$$ \frac{412361082084625218756}{28134} = 14657037111133334$$Numbers with this property form OEIS A249764:

 
A249764: numbers which divide the concatenation, in ascending order, of their anti-divisors.

Up to 40000, these numbers are relatively rare (permalink): 

15, 30, 105, 120, 150, 222, 375, 585, 1500, 1695, 1755, 1800, 2700, 3449, 3750, 3840, 4891, 6720, 7680, 12000, 13583, 14400, 15000, 18750, 19200, 20940, 28134, 30000, 34800, 35625

The OEIS lists an analog of this, namely OEIS A069872:

 
A069872: numbers \(k\) such that \(k\) divides the concatenation all divisors in ascending order.

Comparatively, members of this sequence are rather more numerous. There are 181 numbers in the range up to 40000 (permalink):

1, 2, 4, 5, 6, 8, 10, 15, 16, 20, 24, 25, 30, 32, 40, 50, 60, 64, 80, 90, 96, 100, 104, 120, 124, 125, 128, 150, 160, 200, 240, 250, 255, 256, 288, 320, 360, 375, 380, 384, 400, 425, 464, 480, 495, 500, 512, 600, 618, 625, 640, 750, 795, 800, 864, 875, 960, 1000, 1024, 1110, 1230, 1250, 1280, 1300, 1390, 1400, 1408, 1440, 1469, 1500, 1525, 1536, 1600, 1632, 1920, 2000, 2048, 2050, 2250, 2400, 2500, 2556, 2560, 2910, 2944, 2952, 3000, 3040, 3125, 3200, 3330, 3360, 3625, 3750, 3825, 3840, 4000, 4096, 4304, 4625, 4650, 4992, 5000, 5120, 5250, 5280, 5300, 5568, 5760, 6000, 6144, 6150, 6250, 6400, 6528, 6750, 7168, 7200, 7560, 7680, 8000, 8192, 9000, 9330, 9375, 9600, 10000, 10240, 10500, 10752, 11875, 12000, 12500, 12800, 13410, 13600, 14000, 15000, 15360, 15625, 15680, 16000, 16384, 16640, 17500, 17920, 18432, 18750, 19710, 20000, 20200, 20250, 20480, 20610, 21600, 21760, 22752, 23040, 23375, 24000, 24120, 24576, 25000, 25600, 25984, 27000, 28125, 30720, 31250, 32000, 32768, 33930, 34480, 34800, 35000, 36000, 37500, 37830, 38400, 39000, 40000

A variation on this is OEIS A240265:


A240265: numbers that divide the concatenation of their aliquot divisors, in ascending order.

These are less numerous. In the range up to 40000, they are:

4, 15, 16, 255, 375, 495, 795, 1469, 3825, 9375, 28125

All these numbers are also in OEIS A069872 and are marked in red in that sequence's list of members. It can be seen that 28125 is rather special and this number marked my diurnal age only 9 days ago. However, at the time, I missed its membership in these two sequences.

Saturday, 28 February 2026

Ups and Downs

My last post titled "The Path to Unity" focused on numbers that lead to zero when the recurrence shown in Figure 1 is applied:


Figure 1

Today, the number associated with my diurnal age (28090) leads to a sequence with wild gyrations but that eventually loops. Firstly though, the factorisation:$$28090=2 \times 5 \times 53^2$$The sequence has 164 members:

28090, 337080, 16179840, 112360, 2696640, 226517760, 73391754240, 67813980917760, 253895544556093440, 19590705598464, 6976747008, 3767443384320, 1453488960, 732558435840, 381540852, 82412824032, 95385213, 6867735336, 3296512961280, 1271802840, 488372290560, 308315840, 51797061120, 31078236672000, 72723073812480000, 6464273227776, 8144984266997760, 1414059768576, 1374466095055872, 4354308589137002496, 50161634946858268753920, 1209530163649167360, 69995958544512, 201588360608194560, 14284889498880, 3306687384, 1269767955456, 801621184, 134672358912, 80803415347200, 283619987868672000, 18757935705600, 60775711686144000, 4637951136000, 1431466400, 463795113600, 214719960, 61839348480, 80143795630080, 21405928320, 24775380, 4013611560, 7963515, 477810900, 1474725, 53090100, 11467461600, 15168600, 2184278400, 5056200, 546069600, 1685400, 121348800, 30579897600, 31460800, 3964060800, 2568711398400, 5340350997273600, 674286742080, 501701445, 63214382070, 27308613054240, 47189283357726720, 10923445221696, 10836751212, 2925922827240, 2738663766296640, 724514223888, 521650241199360, 172503386640, 113852235182400, 344289159191577600, 28980568955520, 66771230873518080, 12420243838080, 9952118460, 2149657587360, 3980847384, 573242023296, 192609319827456, 208018065413652480, 64203106609152, 63693558144, 221158188, 19904236920, 5732420232960, 4333709696117760, 9724844558088253440, 109229454076447262638080, 3010070934646364160, 307401034992480, 142315293978, 40986804665664, 48200482286820864, 260282604348832665600, 10299248351884800, 72300723430231296000, 2615043526845750, 9790722964510488000, 431689725066600, 2051389573516483200, 113061594660300, 46527405210, 25124798813400, 65123478524332800, 7444384833600, 21104831003256000, 1550913507000, 2679978540096000, 20260637763125760000, 577226147097600, 69411513600, 89957321625600, 24027062400, 27809100, 4505074200, 2270557396800, 1001127600, 2224728, 30899, 185394, 4449456, 400451040, 1112364, 60067656, 8649742464, 22525371, 946065582, 181644591744, 210236796, 45411147936, 70078932, 12614207760, 15016914, 1081217808, 259492273920, 266967360, 89701032960, 67955328, 353934, 12741624, 1528994880, 3033720, 291237120, 1078656, 22472, 269664, 9707904, 101124, 2730348, 50562, 2809, 8427, 50562

If we plot the sequence members, we get what is shown in Figure 2.


Figure 2

As can be seen, there are two massive spikes. The factorisations of both numbers are as follows:

  • \(50161634946858268753920 = 2^{23} \times 3^{11} \times 5 \times 7^5 \times 11 \times 13 \times 53^2\)
  • \(109229454076447262638080 = 2^{17} \times 3^{20} \times 5 \times 7 \times 11 \times 13 \times 17 \times 53^2\)

The associated number of divisors are:

  • \(50161634946858268753920\) has \(41472\) divisors
  • \(109229454076447262638080\) has \(36288\) divisors

These numbers of divisors of course divide into each of their respective numbers:

  • \( \dfrac{50161634946858268753920}{41472}=1209530163649167360\)
  • \( \dfrac{109229454076447262638080}{36288}=3010070934646364160\)
Figure 3 shows the trajectory plotted on a vertical logarithmic scales where the ups and downs are clearly visible and the difference in height between the the two spikes seems minor:


Figure 3: vertical logarithmic scale

The takeaway to all this is that, even though many sequences "blow up" under the rules imposed, some still manage to enter a loop despite having impressive spikes. Notice how the loop (50562, 2809, 8427, 50562) occurs:

  • \(50562 = 2 \times 3^2 \times 53^2 \text{ with }18 \text{ divisors} \)
  • \(2809 = 53^2 \text{ with } 3 \text{ divisors} \)
  • \(8427 = 3 \times 53^2 \text{ with } 6 \text{ divisors} \)
  • \(50562 = 2 \times 3^2 \times 53^2 \text{ with } 18 \text{ divisors}\)
\(2809\) is the minimum value reached and this is simply our original number (28090) divided by 10. Thus we have:$$ \frac{28090}{10}=2809 \text{ as the minimum value}$$Once again, the behaviour of the number 28090 (or any other number) under the above rules is INDEPENDENT of the number system being used.

Thursday, 26 February 2026

The Path to Unity

In my blog post titled A Revision, I set the following rules to be applied to any given natural number:

  • if a \(4k+1\) prime, double it and add 1: \(n \rightarrow 2n+1\) 
  • if a \(4k+3\) prime, subtract 1 and divide by 2: \(n \rightarrow (n-1)/2\) 
  • if composite, determine its number of divisors \(d\) 
    • if \( n \pmod d \equiv 0\) then \(n \rightarrow \dfrac{n}{d} \) 
    • if \( n \pmod d \not\equiv 0 \) then \(n \rightarrow n \times d\)
Keep repeating this process until a loop is reached or call a stop after a fixed number of iterations.

Applying this rule to the number associated with my diurnal age today, 28088, I noticed that the resulting sequence ended in a 1:

28088, 3511, 1755, 28080, 351, 2808, 89856, 1248, 52, 312, 4992, 156, 13, 27, 108, 9, 3, 1

This got me wondering as to how many numbers in the range up to 40000 generate sequences that end in 1. It turns out that 810 numbers satisfy this criterion. I'll list only those from 28000 onwards but this permalink will generate the entire list:

28064, 28080, 28088, 28224, 28440, 28800, 29025, 29511, 29862, 30190, 30240, 30320, 30336, 30370, 30474, 30477, 30482, 30483, 30698, 30699, 30780, 30782, 30790, 30800, 30852, 30854, 30960, 31104, 31131, 31266, 31267, 31338, 31500, 31572, 31574, 31593, 31599, 31736, 31764, 31791, 31995, 32128, 32400, 32790, 32928, 33600, 33696, 33750, 33753, 33792, 33870, 33885, 33912, 34022, 34074, 34110, 34128, 34152, 34156, 34300, 34590, 34651, 34830, 34976, 34992, 35000, 35102, 35110, 35550, 35694, 35703, 36000, 36056, 36128, 36152, 36216, 36228, 36384, 36444, 36446, 36451, 36480, 36576, 36864, 36896, 36948, 37152, 37500, 37800, 37920, 38100, 38271, 38397, 38421, 38500, 38880, 39348, 39670

Of the numbers in the entire range from 1 to 40000, the highest peak reached was \( \textbf{90720000}\). The starting numbers that reached this peak were 1125, 2251, 4502, 6753, 9004, 12375, 13500, 18008, 20259, 22510, 27012. For example, 27012 has the following trajectory.

27012, 2251, 1125, 13500, 648000, \( \textbf{90720000} \), 201600, 1400, 33600, 400, 6000, 150, 1800, 50, 300, 5400, 259200, 2160, 54, 432, 8640, 483840, 3024, 120960, 945, 15120, 189, 1512, 48384, 672, 28, 168, 2688, 84, 7, 3, 1

Figure 1 shows these points plotted on vertical logarithmic scale.


Figure 1

Here is what Gemini had to say about these numbers in general:

An analysis of this dataset reveals several fascinating mathematical properties about how this specific sequence behaves. Out of the 40,000 integers evaluated, only 810 successfully collapse to 1. This means you have a precise 2.025% success rate within this range.

Here is a comprehensive breakdown of the patterns, groupings, and behaviors hidden within these 810 numbers.

1. The Density Decay (Sparsity at Scale)

The most prominent pattern is how rapidly the density of successful numbers drops off as the starting values increase. The sequence strongly favors smaller numbers.

  • High Concentration (1 to 1,000): There are 113 successful numbers in the first 1,000 integers. Over 11% of the starting pool.
  • The Mid-Range (10,000 to 20,000): The grouping thins out significantly, with numbers often clustered in small pockets followed by wide dead zones.
  • Extreme Sparsity (39,000 to 40,000): In the final 1,000 integers of your range, only two numbers (39348 and 39670) manage to reach 1.

Why this happens: As numbers grow larger, their divisor counts ($d$) become highly variable. To shrink a composite number, it must be perfectly divisible by its divisor count ($n \pmod d \equiv 0$). For massive numbers, missing this exact modulus check results in multiplying by $d$ instead, which instantly inflates the sequence beyond recovery.

2. The $4k + 3$ Prime Accelerators

If we look at the prime numbers in your successful list (3, 7, 13, 19, 43, 79, etc.), there is a heavy bias toward primes of the form $4k + 3$.

  • The $4k + 3$ Shortcuts: Primes like 3, 7, 19, 43, and 79 all fit the $4k + 3$ rule. Because your logic dictates that these primes undergo the operation $\frac{n - 1}{2}$, they act as immediate mathematical "shortcuts," instantly halving the sequence and driving it downward.

  • The $4k + 1$ Hurdle: Primes of the form $4k + 1$ (like 13) are much rarer in the list. Their rule is to double and add 1 ($2n + 1$), which causes them to inflate. For a $4k + 1$ prime to succeed, it must inflate into a highly specific composite number that happens to have a perfect divisor ratio. For example, 13 inflates to 27, which perfectly cascades down to 108, then 9, then 3, then 1.

3. The "Perfect Division" Composites

Many of the even numbers on this list are highly composite or share specific divisor ratios that allow them to perfectly trigger the $\frac{n}{d}$ reduction rule multiple times in a row.

Look at a number like 2520. It is a highly composite number with exactly 48 divisors. However, 2520 is not perfectly divisible by 48 (2520 / 48 = 52.5). This means it actually inflates first (2520 × 48 = 120,960) before finding a pathway back down.

Conversely, a number like 24 has exactly 8 divisors. Because $24 \pmod 8 \equiv 0$, it immediately shrinks to 3, which is a prime that shrinks to 1.

4. Convergence Gateways

Every single one of these 810 numbers does not find its own unique path to 1. They act like a massive river system, with hundreds of tiny tributaries eventually flowing into the exact same few mathematical gateways.

If you trace the sequences of these 810 numbers, you will find that almost all of them eventually hit 3, 7, 9, or 24 before reaching 1. The list you generated is essentially a map of every single starting integer under 40,000 that manages to mathematically stumble into one of those four specific choke points without exceeding the 100,000,000 inflation limit first.

Saturday, 31 January 2026

Abundant But Not Zumkeller

A property of the number \( \textbf{28062}\) associated with my diurnal age today prompted me to look more closely at abundant numbers that are not Zumkeller. 28062 has the following properties:$$ \begin{align} 28062 &=2 \times 3^2 \times 1559\\ \text{ divisors }  &\rightarrow 1, 2, 3, 6, 9, 18, 1559, 3118, 4677, 9354, 14031, 28062 \end{align}$$Normally, for abundant numbers, the set of divisors can be divided into two mutually exclusive sets whose elements sum to the same number. However, this simply can't be done with 28062.

Now up to 40000, there are 718 abundant numbers that are abundant but not Zumkeller. 146 of these have an odd sum of divisors and an even split is not possible. The other 572 have an even sum of divisors and thus have the potential for an even split but it proves impossible to find one. Here are the details:

There are 572 abundant numbers with an \( \textbf{even}\) sum of divisors. They are (up to 40000):

[738, 748, 774, 846, 954, 1062, 1098, 1206, 1278, 1314, 1422, 1494, 1602, 1746, 1818, 1854, 1926, 1962, 2034, 2286, 2358, 2466, 2502, 2682, 2718, 2826, 2934, 3006, 3114, 3222, 3258, 3438, 3474, 3492, 3546, 3582, 3636, 3708, 3798, 3852, 3924, 4014, 4068, 4086, 4122, 4194, 4302, 4338, 4518, 4572, 4626, 4716, 4734, 4842, 4878, 4932, 4986, 5004, 5058, 5094, 5274, 5364, 5436, 5526, 5598, 5634, 5652, 5706, 5868, 5958, 6012, 6066, 6228, 6246, 6282, 6354, 6444, 6462, 6516, 6606, 6714, 6822, 6876, 6894, 6948, 7002, 7092, 7146, 7164, 7218, 7362, 7542, 7544, 7578, 7596, 7758, 7794, 7902, 7974, 8028, 8082, 8172, 8226, 8244, 8298, 8334, 8388, 8406, 8604, 8622, 8676, 8766, 8838, 8982, 9036, 9054, 9162, 9252, 9378, 9414, 9468, 9684, 9738, 9756, 9846, 9972, 10026, 10116, 10134, 10184, 10188, 10242, 10278, 10386, 10548, 10566, 10674, 10782, 10818, 10926, 11034, 11052, 11106, 11142, 11196, 11268, 11358, 11412, 11538, 11574, 11646, 11754, 11862, 11898, 11916, 12114, 12132, 12186, 12294, 12438, 12492, 12564, 12618, 12708, 12762, 12924, 12942, 13086, 13194, 13212, 13302, 13374, 13428, 13518, 13626, 13644, 13698, 13788, 13842, 13914, 14004, 14166, 14184, 14292, 14328, 14346, 14436, 14562, 14598, 14724, 14778, 14814, 14886, 14922, 15084, 15102, 15156, 15192, 15354, 15426, 15462, 15516, 15534, 15588, 15786, 15804, 15858, 15894, 15948, 15966, 16056, 16164, 16326, 16344, 16398, 16452, 16488, 16542, 16596, 16668, 16722, 16776, 16812, 16866, 16938, 17046, 17154, 17208, 17244, 17352, 17406, 17478, 17532, 17586, 17676, 17694, 17838, 17946, 17964, 18072, 18108, 18162, 18234, 18324, 18342, 18378, 18504, 18558, 18594, 18702, 18756, 18828, 18882, 18918, 18936, 19098, 19134, 19242, 19368, 19476, 19512, 19566, 19638, 19674, 19692, 19746, 19854, 19944, 19962, 20052, 20106, 20214, 20232, 20268, 20322, 20376, 20484, 20556, 20718, 20754, 20772, 20934, 21078, 21096, 21132, 21258, 21348, 21366, 21474, 21564, 21618, 21636, 21834, 21852, 21906, 22014, 22068, 22104, 22122, 22158, 22212, 22266, 22284, 22300, 22392, 22482, 22536, 22662, 22700, 22716, 22824, 22900, 22986, 23022, 23076, 23094, 23148, 23202, 23238, 23292, 23300, 23346, 23418, 23454, 23508, 23526, 23724, 23742, 23778, 23796, 23832, 23886, 23900, 24100, 24228, 24264, 24372, 24498, 24588, 24606, 24714, 24858, 24876, 24984, 25100, 25128, 25182, 25236, 25362, 25416, 25524, 25614, 25686, 25700, 25722, 25794, 25848, 25884, 25902, 26046, 26118, 26154, 26172, 26262, 26300, 26388, 26424, 26478, 26604, 26658, 26694, 26748, 26766, 26802, 26856, 26874, 26900, 26982, 27036, 27100, 27198, 27252, 27288, 27396, 27414, 27558, 27576, 27684, 27700, 27774, 27828, 27882, 27954, 28008, 28062, 28100, 28206, 28278, 28300, 28332, 28422, 28494, 28584, 28692, 28746, 28818, 28872, 28926, 28962, 29034, 29124, 29142, 29178, 29196, 29286, 29300, 29448, 29466, 29556, 29628, 29772, 29826, 29844, 29934, 30006, 30042, 30168, 30204, 30312, 30474, 30546, 30582, 30700, 30708, 30762, 30852, 30924, 30978, 31014, 31032, 31068, 31100, 31176, 31194, 31300, 31338, 31446, 31554, 31572, 31608, 31662, 31700, 31716, 31788, 31896, 31932, 31986, 32094, 32166, 32202, 32328, 32418, 32598, 32652, 32796, 32814, 32904, 32958, 33084, 33100, 33192, 33246, 33336, 33444, 33498, 33606, 33624, 33678, 33700, 33714, 33732, 33786, 33822, 33876, 34002, 34092, 34218, 34308, 34326, 34434, 34488, 34700, 34758, 34794, 34812, 34900, 34956, 35064, 35082, 35118, 35172, 35300, 35352, 35388, 35514, 35622, 35676, 35766, 35874, 35892, 35900, 35928, 35946, 35982, 36054, 36198, 36216, 36306, 36324, 36468, 36486, 36522, 36648, 36684, 36700, 36702, 36756, 36954, 37116, 37134, 37188, 37242, 37300, 37404, 37458, 37494, 37512, 37566, 37602, 37656, 37764, 37782, 37836, 37900, 37998, 38034, 38196, 38268, 38300, 38322, 38358, 38466, 38484, 38538, 38574, 38754, 38898, 38900, 38952, 39132, 39222, 39276, 39348, 39384, 39492, 39654, 39700, 39708, 39726, 39834, 39924, 39978]

There are 146 abundant numbers with an \( \textbf{odd}\) sum of divisors. These are up to 40000:

[18, 36, 72, 100, 144, 162, 196, 200, 288, 324, 392, 400, 450, 576, 648, 784, 800, 882, 900, 968, 1152, 1296, 1352, 1458, 1568, 1600, 1764, 1800, 1936, 2178, 2304, 2450, 2500, 2592, 2704, 2916, 3042, 3136, 3200, 3528, 3600, 3872, 4050, 4356, 4608, 4624, 4900, 5000, 5184, 5202, 5408, 5776, 5832, 6050, 6084, 6272, 6400, 6498, 7056, 7200, 7744, 7938, 8100, 8450, 8464, 8712, 9216, 9248, 9522, 9604, 9800, 10000, 10368, 10404, 10816, 11025, 11250, 11552, 11664, 12100, 12168, 12544, 12800, 12996, 13122, 13456, 14112, 14400, 15138, 15376, 15488, 15876, 16200, 16900, 16928, 17298, 17424, 18432, 18496, 19044, 19208, 19600, 19602, 20000, 20736, 20808, 21632, 22050, 22500, 23104, 23328, 23716, 24200, 24336, 24642, 25088, 25600, 25992, 26244, 26912, 27378, 28224, 28800, 28900, 30258, 30276, 30752, 30976, 31752, 32400, 33124, 33282, 33800, 33856, 34596, 34848, 36100, 36450, 36864, 36992, 38088, 38416, 39200, 39204, 39762, 40000]

The total number is 718

Note how I've marked 11025 in red. This is because it is the only odd number with an odd number of divisors. We have:$$11025 = 3^2 \times 5^2 \times 7^2 = 105^2 \text{ with 27 divisors}$$The next such number is 99225 where:$$99225=3^4 \times 5^2 \times 7^2 = 315^2 \text{ with 243 divisors}$$

Let's not confuse oddness and evenness of the divisor sums with the oddness and evenness of the numbers themselves. The majority of Zumkeller numbers are even. To quote from an earlier blog of mine:

In the range up to 100,000 there are 24362 even Zumkeller numbers comprising 24.362% of the range. However, there are only 208 odd Zumkeller numbers in that range, comprising 0.208%.

Wednesday, 28 January 2026

Number's Divisors to Sequence Algorithm

A logical progression to looking at the sequence produced by considering the factors of a number (see Number's Factors to Sequence Algorithm 1 and Number's Factors to Sequence Algorithm 2) is to consider the sequence formed by its divisors. The rules this time around are very similar to that for factors except that we are dealing now with the number's divisors.

 Suppose we take any positive integer \(n \gt 1\) 
  • if prime, double it and add 1: \(n \rightarrow 2n+1\)
  • if composite, determine its number of divisors \(d\)
  • if \( n \pmod d \equiv 0\) then \(n \rightarrow \dfrac{n}{d} \)
  • if \( n \pmod d \not\equiv 0 \) then \(n \rightarrow n \times d\)
Keep repeating this process until a loop is reached or call a stop after a fixed number of iterations. 

Let's use 28059 as an example. Applying the above rules leads to the following sequence:

28059, 224472, 7183104, 517183488, 2693664, 37412, 448944, 17957760, 140295, 2244720, 28059

We end up right where we started. Here the details with number of divisors shown (permalink):
28059 --> 8
224472 --> 32
7183104 --> 72
517183488 --> 192
2693664 --> 72
37412 --> 12
448944 --> 40
17957760 --> 128
140295 --> 16
2244720 --> 80
28059 --> 8
As before we are interested in record lengths and my algorithm was not up to the job of determing these so I had to call on Gemini for help. It came up with the following record breaking numbers in the range up to one million (permalink). This algorithm proved to be faulty. For the correction see blog post titled "A Correction".

2, 3, 6, 11, 22, 44, 50, 99, 125, 206, 350, 463, 487, 974, 1375, 1573, 1625, 5200, 14157, 16879, 18747, 39325, 89237, 151911, 563553, 803133

Here are the details of the lengths:

Number     | Length     | Status
-----------------------------------
2          | 5          | New Record!     
3          | 8          | New Record!     
6          | 10         | New Record!     
11         | 21         | New Record!     
22         | 23         | New Record!     
44         | 25         | New Record!     
50         | 28         | New Record!     
99         | 32         | New Record!     
125        | 33         | New Record!     
206        | 34         | New Record!     
350        | 37         | New Record!     
463        | 44         | New Record!     
487        | 46         | New Record!     
974        | 48         | New Record!     
1375       | 51         | New Record!     
1573       | 52         | New Record!     
1625       | 60         | New Record!     
5200       | 62         | New Record!     
14157      | 63         | New Record!     
16879      | 64         | New Record!     
18747      | 67         | New Record!     
39325      | 70         | New Record!     
89237      | 71         | New Record!     
151911     | 75         | New Record!     
563553     | 77         | New Record!     
803133     | 82         | New Record!  

Let's look at the sequence for the last number in the above list, 803133 (permalink):

803133, 4818798, 77100768, 1606266, 19275192, 616806144, 8566752, 356948, 2141688, 34267008, 1070844, 89237, 178475, 3212550, 346955400, 149884732800, 115651800, 321255, 11565180, 64251, 1156518, 69391080, 19984631040, 23130360, 5551286400, 6425100, 1040866200, 524596564800, 231303600, 514008, 7139, 42834, 1028016, 92521440, 257004, 13878216, 1998463104, 5204331, 218581902, 41967725184, 48573756, 10491931296, 16191252, 2914425360, 3469554, 249807888, 59953893120, 61680960, 20724802560, 15700608, 4019355648, 7850304, 35046, 1121472, 125604864, 356832, 3717, 44604, 2140992, 299738880, 555072, 6608, 132160, 2360, 37760, 1180, 14160, 354, 2832, 56640, 3171840, 19824, 792960, 6195, 99120, 1239, 9912, 317184, 22837248, 118944, 1652, 19824

Like the previous sequences using the number of factors, this sequence using the number of divisors is also \( \textbf{base independent}\).

Thursday, 11 December 2025

Nothing in Common

Looking at the number associated with my diurnal age today, 28011, I noticed that its prime factors (3 and 9337) contain none of the digits of the number itself. I wondered how many numbers from 1 up to 40000 share this property. It turns out that 1996 numbers do (permalink) including a near neighbour of 28011, namely 28009 with prime factors of 37 and 757. The first such number is 4 since it is composite and has only one prime factor (2). Table 1 shows the results for the suitable numbers between 28000 and 29000. All except 28509 are biprimes or triprimes.


Table 1

Now these two neighbours (28009 and 28011) are different when it comes to their proper divisors. Let's compare:$$ \begin{align} 28009 &\rightarrow 1, 37, 757 \\ 28011 &\rightarrow 1, 3, 9337 \end{align}$$The proper divisors of 28009 have no digits in common with the digits of the number but the proper divisors of 28011 do (the digit 1). Again I wondered how many other numbers share this property with 28009. Well, it turns out that this property is a little less common than that of the prime factors because none of the numbers can contain the digit 1. In fact, in the range up to 40000, there are only 300 numbers that satisfy compared to 1996 for the prime factors (permalink). All are biprimes and are a subset of the numbers we obtained for the prime factors. Table 1 shows such numbers in the range between 28000 and 29000.


Table 2

So that's it, just something interesting in the domain of recreational mathematics.

Sunday, 2 November 2025

Palindromic Day 27972

Today is palindromic day 27972 and the last palindromic day of the current millenium. The next palindromic day will occur in the new millenium and will 28082, one hundred and ten days from now.

My first observation is that the digits on either side of the central 9 also add to 9 to give a 9 - 9 - 9 pattern with 9 being the arithmetical digital root as well. This is the first and last time that such a triple pattern will occur in the current millenium. It cannot occur in the next two millenia (2 8 x 8 2 and 2 9 x 9 2) because the digits on either side of the central digit add to 10 and 11 respectively. So already 27972 is rather special. 

27972 is also a member of OEIS A344422: palindromes having more divisors than all smaller palindromes. The table below lists the initial members of this sequence and it can be seen that 27972 has a record 48 divisors.

  number   factorisation        divisors

  1        1                    1
  2        2                    2
  4        2^2                  3
  6        2 * 3                4
  44       2^2 * 11             6
  66       2 * 3 * 11           8
  252      2^2 * 3^2 * 7        18
  2112     2^6 * 3 * 11         28
  2772     2^2 * 3^2 * 7 * 11   36
  6336     2^6 * 3^2 * 11       42
  27972    2^2 * 3^3 * 7 * 37   48
  48384    2^8 * 3^3 * 7        72

27972 is also a member of OEIS A020485: least positive palindromic multiple of \(n\), or 0 if none exists. Here are the multiples for the initial values of \(n\).

  count   n       multiple
  1       1       1
  2       2       1
  3       3       1
  4       4       1
  5       5       1
  6       6       1
  7       7       1
  8       8       1
  9       9       1
  10      0       0
  11      11      1
  12      252     21
  13      494     38
  14      252     18
  15      525     35
  16      272     17
  17      272     16
  18      252     14
  19      171     9
  20      0       0
  21      252     12
  22      22      1
  23      161     7
  24      696     29
  25      525     21
  26      494     19
  27      999     37
  28      252     9
  29      232     8
  30      0       0
  31      434     14
  32      2112    66
  33      33      1
  34      272     8
  35      525     15
  36      252     7
  37      111     3
  38      494     13
  39      585     15
  40      0       0
  41      656     16
  42      252     6
  43      989     23
  44      44      1
  45      585     13
  46      414     9
  47      141     3
  48      2112    44
  49      343     7
  50      0       0
  51      969     19
  52      676     13
  53      212     4
  54      27972   518
  55      55      1
  56      616     11
  57      171     3
  58      232     4
  59      767     13
  60      0       0
  61      26962   442

27972 requires 13 steps to reach the palindrome 4964444694 under the Reverse and Add algorithm. 

27972 is a decagonal or ten-sided number and is the 84th decagonal number and the second non-trivial palindromic decagonal number after 232. See Figure 1 where 232 is shown but not 27972.


Figure 1: source

27972 is a member of OEIS A356854: palindromes that can be written in more than one way as the sum of two distinct palindromic primes. In the case of 27972 we have:

10501 + 17471 = 27972
11311 + 16661 = 27972
11411 + 16561 = 27972
12421 + 15551 = 27972