Monday, 19 October 2026

Even Number Bias

 I asked Gemini the following:

Whenever I set the temperature of the air conditioner, I invariably choose an even number (usually 24) and seldom do I choose an odd number. I only realised this when I’d accidentally set it to 23 degrees Celsius. Is there any research into the possibility of an even number bias whenever there is a choice of even or odd numbers?

Here is its response:

There is a robust body of cognitive psychology and numerical cognition research confirming that humans exhibit a distinct bias toward even numbers when setting arbitrary values like thermostat temperatures, television volumes, and alarm clocks. In cognitive science, this phenomenon is driven by processing fluency, the MARC effect, and semantic associations tied to parity.

1. The Parity Effect and Processing Fluency

In the study of numerical cognition, researchers have long observed that the human brain does not treat odd and even numbers equally. Known as the odd-even effect or parity preference, studies consistently demonstrate that people process even numbers faster and with fewer errors than odd numbers.

  • Reaction Time Studies: In classic parity judgment tasks (where subjects must quickly press a button to identify whether a flashed digit is odd or even), Terence Hines (1990) and subsequent researchers found that human reaction times are significantly faster for even digits than for odd ones.

  • Addition and Multiplication Fluency: Because we learn our multiplication tables early in life, and because multiplying any integer by an even number always yields an even result, even numbers occur much more frequently in our mental arithmetic lexicon.

  • Cognitive Ease: Psychologists refer to this speed and familiarity as processing fluency. When our brains can process a stimulus with less friction, we experience a subtle, subconscious positive affect toward it. When you look at a thermostat display, 24 simply "feels" more settled and harmonious than 23 because your brain processes it with slightly less cognitive effort.

2. Divisibility and the Need for Symmetry

From a mathematical standpoint, the defining characteristic of an even number is its divisibility by 2 without a remainder. In everyday psychology, this translates into a visceral sense of balance, symmetry, and completeness.

  • Mental Halving: Even numbers can be split cleanly into two equal parts (24 = 12 + 12), whereas odd numbers leave a " messy" remainder or fraction (23 = 11.5 + 11.5). When setting an environmental control like an air conditioner or a car radio volume, the brain treats the number not just as a measurement of heat or sound, but as a visual and conceptual anchor. An odd number like 23 subconsciously registers as "incomplete" or "off-balance," sitting uneasily between two stable points (22 and 24).

  • The "Round Number" Heuristic: Research by Schindler and Kirby (1997) into pricing and numerical preferences shows that humans gravitate toward numbers that feel "round" or serve as natural cognitive reference points. While multiples of 5 and 10 are the strongest anchors (which is why many people tolerate 25 on a volume dial even though it is odd), even numbers act as secondary anchors of stability across the entire number line.

3. Semantic Associations: "Good" vs. "Strange"

Psychologist Laurence E. Bourne Jr. and colleagues (such as Wilkie & Bodenhausen, 2012) have investigated the deep-seated semantic and linguistic associations tied to parity. Across many cultures and languages, the very words used to describe parity carry heavy emotional and aesthetic weight:

  • Linguistic Framing: In English, "even" is synonymous with calm, balanced, fair, smooth, and level-headed. Conversely, "odd" literally means strange, peculiar, mismatched, deviant, or left over.

  • Implicit Personality and Gender Attribution: In experiments where participants were asked to rate the abstract "personalities" of digits, even numbers were consistently rated as more agreeable, peaceful, and comforting, while odd numbers were rated as more aggressive, jagged, and active. When your goal is to create a comfortable, climate-controlled environment, your subconscious naturally aligns the desired physical state (calm, balanced comfort) with the numerical category that shares those exact semantic traits.

4. The MARC Effect (Spatial-Numerical Association)

Another neurological quirk discovered by Jean-Paul Nuerk and colleagues (2004) is the MARC effect (Markedness Association of Response Codes).

  • Linguistic Markedness: In linguistics, pairs of opposites usually have an "unmarked" (default, positive, primary) term and a "marked" (secondary, negated, or derivative) term—such as tall/short or happy/unhappy. In numerical cognition, even is the unmarked default state, while odd is the marked deviation.

  • Right-Side Advantage: For right-handed individuals (and most left-handed individuals due to reading direction), the brain spatially maps "even" to the right side of space—the dominant, preferred side for action—and "odd" to the left. Because we associate our dominant side with fluency and control, choosing an even number on a digital interface subtly reinforces a sense of mastery and order over our surroundings.

Why 24 Specifically Stands Out

Your specific preference for 24 over other numbers in that temperature range has an extra layer of mathematical reinforcement. Beyond simply being an even number in the ideal thermal comfort zone for tropical and subtropical climates, 24 is a highly composite number.

Whereas 22 is only divisible by 1, 2, 11, and 22, and 26 is only divisible by 1, 2, 13, and 26, the number 24 has eight factors (1, 2, 3, 4, 6, 8, 12, 24). In numerical cognition, numbers with high divisibility (like 12, 24, 36, and 60) possess the highest degree of mental fluency because we encounter them constantly in timekeeping (24 hours in a day), geometry, and measurement. Spotting 23 on your display jarred your attention because you moved from one of the most divisible, harmonious integers in daily life to a prime number with no factors other than 1 and itself. 

Embedded Primes Versus Prime Partitions

I noticed that the number associated with my diurnal age today (28323), while not prime, has digits that are all prime with the exception of 8 and it also has two other primes contained within it (283 and 23). I asked Gemini the following question:

28323 is a composite number with the property that it is a concatenation of prime numbers in various ways e.g. 283 || 23 and 2 || 83 || 23 where I’ve used the symbol || for concatenation. Write a program in SageMath that will identify all composite numbers in a given range that are concatenations of prime numbers in two or more different ways. The output should be a list of comma-separated numbers. The default range can be from 4 to 40000 and the upper and lower limits of the range should be easily adjustable. There should also be a switch so that the program can search for prime numbers with the same property, although the default should be set to composite. The number of suitable concatenations should be adjustable as well, although 2 is to be the default. Can a count of the suitable numbers be included in the output, underneath the list of numbers.

The program as requested is quite flexible. Below are the opening lines of code:

# --- Adjustable Parameters ---

LOWER_LIMIT = 4

UPPER_LIMIT = 40000

SEARCH_PRIMES = True  # False = search for composite numbers (default), True = search for primes

MIN_WAYS = 11         # Minimum number of valid prime concatenations required

# -----------------------------

Using these settings and thus searching for all primes in the range from 4 to 40000 that can be concatenated in at least 11 different ways, I found only a single number: 37337 (permalink). However, OEIS A179919 that lists primes with eleven embedded primes listed 111317 as the first number. Clearly I was confused and I sought clarification from Gemini. Here is its explanation:

The discrepancy comes down to two fundamentally different mathematical definitions: full-string prime partitions (concatenations) versus distinct proper prime substrings (embedded primes).

Your SageMath program counts the number of ways an entire number can be sliced into a complete concatenation of prime pieces from left to right, whereas OEIS A179919 counts how many distinct prime numbers appear anywhere inside the number as contiguous substrings (excluding the prime itself).

1. What Your Program Counts: Prime Concatenations (37337)

Your program requires every single digit of the number to be used in each partition. A 5-digit number has 2^{5-1} - 1 = 15 possible ways to be sliced into two or more contiguous pieces.

For the prime number 37337, 11 of those 15 full-string partitions consist entirely of prime numbers:

  1. 3 || 7 || 3 || 3 || 7

  2. 3 || 7 || 3 || 37

  3. 3 || 7 || 337

  4. 3 || 73 || 3 || 7

  5. 3 || 73 || 37

  6. 37 || 3 || 3 || 7

  7. 37 || 3 || 37

  8. 37 || 337

  9. 373 || 3 || 7

  10. 373 || 37

  11. 3733 || 7

(The only 4 slices of 37337 that fail are the ones containing the composite substrings 33 or 733: 3 || 7 || 33 || 7, 3 || 733 || 7, 37 || 33 || 7, and 3 || 7337.)

2. What OEIS A179919 Counts: Distinct Embedded Primes (111317)

In the OEIS family of sequences (such as A039996 and A179909–A179924), an "embedded prime" is defined as a distinct prime proper substring occurring anywhere within the base-10 representation of the prime.

Under the OEIS definition, three completely different rules apply:

  • The rest of the digits do not need to form primes: You just extract a contiguous block of digits from the number and ignore the digits to the left and right.

  • Duplicates are only counted once: You collect the substrings into a mathematical set of unique prime values.

  • Composite digits like 1 are helpful: Because you don't have to partition the entire number into primes, having the digit 1 (which is not prime and ruins full concatenations) is actually an advantage in A179919 because 1 starts many multi-digit primes (11, 13, 17, 113, 131, 317, etc.).

If we evaluate your number 37337 using the OEIS "embedded primes" rule, it only has 6 embedded primes:

$$\{3, 7, 37, 73, 337, 373, 3733\} \longrightarrow \text{7 primes?}$$

Actually, checking all contiguous proper substrings of 37337:

  • 1-digit: 3, 7 (repeats ignored)

  • 2-digit: 37, 73 (33 is composite)

  • 3-digit: 373, 337 (733 is prime! Wait: 733 is indeed prime!)

  • 4-digit: 3733 (prime), 7337 (7337 = 11 \times 667, composite)

Even with 733 being prime, the set of distinct proper prime substrings of 37337 is \{3, 7, 37, 73, 337, 373, 733, 3733\}, which is only 8 distinct embedded primes (falling short of 11). Furthermore, note that because 733 is prime, 37337 actually has 12 valid prime concatenations in your program (3 || 733 || 7 is also valid!), which is why it passed your MIN_WAYS = 11 threshold (>= 11).

Now compare that to 111317, the first term of OEIS A179919:

  • Under your concatenation program: 111317 has only 1 valid prime concatenation (11 || 13 || 17), because any slice that isolates a single 1 (1 || 11317, 111 || 3 || 17, etc.) fails since 1 is not prime.

  • Under OEIS A179919 (distinct proper prime substrings): Scanning all contiguous substrings of 111317 yields 11 distinct primes:

    1. 1-digit: 3, 7 (2 primes)

    2. 2-digit: 11, 13, 17, 31 (4 primes)

    3. 3-digit: 113, 131, 317 (3 primes)

    4. 4-digit: 1113 (3 \times 371, composite), 1131 (3 \times 377, composite), 1317 (3 \times 439, composite) (0 primes)

    5. 5-digit: 11131 (prime), 11317 (prime) (2 primes)

Summing those unique prime substrings gives 2 + 4 + 3 + 0 + 2 = 11 embedded primes:

$$\{3, 7, 11, 13, 17, 31, 113, 131, 317, 11131, 11317\}$$

Side-by-Side Comparison of the Two Rules


Property

Your Program (Prime Concatenations)

OEIS A179919 (Embedded Primes)

Core Mechanism

Partitions the entire string into adjacent prime blocks (A || B || C).

Extracts any contiguous prime substring from anywhere inside the string.

Unused Digits

Forbidden — every digit must belong to a prime block in the partition.

Allowed — surrounding digits outside the substring are ignored.

Repeated Primes

Counted every time they form a distinct full-string partition.

Ignored — only distinct prime values are counted.

Score for 37337

12 valid full-string prime concatenations.

8 distinct embedded primes (\{3, 7, 37, 73, 337, 373, 733, 3733\}).

Score for 111317

1 valid full-string prime concatenation (11 || 13 || 17).

11 distinct embedded primes (\{3, 7, 11, 13, 17, 31, 113, 131, 317, 11131, 11317\}).

I've gotten Gemini to write a program that accepts any positive integer as input, prime or non-prime, and outputs the concatenated primes as well as the embedded primes. Here is the output for 28323 (permalink):

Analysis for 28323 (Composite)

=============================================

1. PRIME CONCATENATIONS (Total: 4)

   1. 2 || 83 || 2 || 3

   2. 2 || 83 || 23

   3. 283 || 2 || 3

   4. 283 || 23

2. DISTINCT EMBEDDED PRIMES (Total: 5)

   2, 3, 23, 83, 283

I've added this program to my daily number analysis.

Sunday, 18 October 2026

More on Days and Dates

In two recent posts, When Days and Dates Align (8th October 2026) and Numbers as Dates (29th April 2026), I've treated my diurnal age's connection with dates using a DD-M-YY or D-M-YY format with the YY being mandatory though ambiguous. As an example, my diurnal age today is 28322 and so in this scheme would be interpreted as 28th March 2022 if we were looking for a date closest to the current date of 18th October 2026).

Another option is to consider a YY-M-DD or YY-MM-D format. Using this format the year changes slowly and today's date would be considered to be 22nd March 2028. This is probably the better format and using this I posed Gemini the following problem:

Today I’m 28322 days old counting my birthday on April 3rd 1949 as Day 0. Interpreting 28322 as YY-M-DD format gives 22nd March 1928. Not 22nd March 2028 because that date is in the future. As my diurnal age increases by 1 each day, when will I reach a number that, interpreted in YY-M-DD or YY-MM-D format, will be in the past. I want the number and its associated date.

Here was its response:

The number is \( \textbf{29201}\), and you will reach it on \( \textbf{15 March 2029}\).

When you are 29,201 days old on 15 March 2029, hyphenating the number in YY-M-DD format gives 29-2-01, which is 1 February 2029—a 21st-century date that is 42 days in the past at that moment.

Here is why no earlier number works:

  • 28801 to 28930 (9 February – 17 June 2028): These are the only valid dates in the 28xxx series left, and they represent August and September 2028—which are still months in the future when you reach those ages.

  • 29000 (26 August 2028): Your day count rolls into the 29xxx series while it is still 2028, so 29 remains in the future for the rest of that year.

  • 29101 to 29131 (5 December 2028 – 4 January 2029): Even when 2029 begins on 1 January 2029 (when you are 29128 days old), 29-1-28 (28 January 2029) and 29-12-8 (8 December 2029) are still ahead of you, as are 29129, 29130, and 29131.

  • 29132 to 29200 (5 January – 14 March 2029): None of these 69 numbers can form a valid calendar date in either YY-M-DD or YY-MM-D format.

  • 29201 (15 March 2029): The very first valid date after that gap is 29-2-01 (1 February 2029), making it the first 21st-century date that lies in the past.

All of this is just some silliness to entertain myself. Expressed mathematically we have a function \(f\) that converts a five digit number \(n=d_1d_2d_3d_4d_5\) to a date whenever it is possible. Thus$$ \begin{align} f(n) &= f(d_1d_2d_3d_4d_5)\\ &=

Thursday, 15 October 2026

Double-Safe and Triple-Safe Primes

A safe prime \(p\) is one such that \( \dfrac{p-1}{2} \) is also prime.
The first example of such a prime is 5 because \( \dfrac{5-1}{2} =2\) which is prime.
However, we can generalise this notion and speak of a \(k\)-safe prime \(p\) where $$ \frac{p-(2^i-1)}{2^i} \text{ is prime for } i=0,1, 2, \dots  k$$Let's look at the various values of \(k\) as applied to a prime \(p\) :

  • \(i=0\) just gives the originating prime \(p\)
  • \(i=1\) means the prime is safe and  \( \dfrac{p-1}{2} \) is prime
  • \(i=2\) means the prime is 2-safe or double-safe and  \( \dfrac{p-3}{4} \) is prime
  • \(i=3\) means the prime is 3-safe or triple-safe and  \( \dfrac{p-7}{8} \) is prime

Let's look at a specific prime, 28319, that is known be a triple safe prime:

  • \(28319\) is prime
  • \(28319 \rightarrow \dfrac{28319-1}{2}  =14159\) which is thus a safe prime
  • \(28319 \rightarrow \dfrac{28319-3}{4} =7079\) which is thus a double-safe prime
  • \(28319 \rightarrow \dfrac{28319-7}{8}  =3539\) which is thus a triple-safe prime
  • \(28319 \rightarrow  \dfrac{28319-15}{16} =1769= 29 \times 61 \) which is not prime
  • These triple-safe primes form OEIS A157358 and the initial members are: 

    23, 47, 719, 1439, 2879, 4079, 9839, 11279, 21599, 28319, 51599, 84719, 92399, 95279, 96959, 137279, 157679, 159119, 178799, 209519, 219839, 243119, 349199, 429119, 430799, 441839, 462719, 481199, 491279, 507359, 533999, 571199, 597599

    As can be seen, 28319 is the last triple-safe prime that I'll see in my lifetime. The double-safe primes form OEIS A066179 and these are more frequent in the range up to 40000:

    11, 23, 47, 167, 359, 719, 1439, 2039, 2879, 4079, 4127, 4919, 5639, 5807, 5927, 6047, 7247, 7559, 7607, 7727, 9839, 10799, 11279, 13799, 13967, 14159, 15287, 15647, 20327, 21599, 21767, 23399, 24407, 24527, 25799, 28319, 28607, 29399, 31607, 35879, 36887

    What about quadruple, quintuple-safe primes and beyond. Up to 40000, there are only three quadruple-safe primes and these are 47, 1439 and 2879. Of these, only 2879 is a quintuple-safe prime (permalink). There is no sextuple-safe prime until we reach 71850239! Up to a billion, there are no septuple-safe primes.

    Wednesday, 14 October 2026

    The Antisigma Function Revisited

    The day after my birthday this year I made a post titled The Antisigma Function. This function returns the sum of the non-divisors of a number and is given by the formula:$$ \text{antisigma}(n)=\frac{n(n+1)}{2}-\sigma(n)$$I noticed today that the number associated with my diurnal age today (28318) has an antisigma value given by:$$ \begin{align} \text{antisigma}(28318) &= 28318 \times 28319/2-\sigma(28318)\\ &=400968721-42480\\ &=400926241 \end{align}$$This antisigma value is almost a multiple of 28318 since:$$ 400926241\!  \! \! \mod 28318 =28315$$This got me wondering whether there are numbers whose antisigma values are multiples of itself. I asked Gemini to investigate and it came to the conclusion that there are no composite integers up to 40,000 (and likely no integers at all) that satisfy this condition. End of story, right. Actually, no. Using the program that Gemini provided I found the following numbers that satisfy (permalink).

    --- Results for Composite Integers 1 to 40000 ---
    Table:
    Composite Integer (n)     | Antisigma Value     
    ------------------------------------------------
    24                        | 240                 
    4320                      | 9318240             
    4680                      | 10937160            
    26208                     | 343351008            
     
    Comma-separated list of the integers:
    24, 4320, 4680, 26208 

    Gemini had to admit its error. So never trust anything Gemini tells you straight up. I then asked if these were the only numbers and it turns out there are infinitely many more. Here is the explanation that Gemini provided:

    For an integer $n$ to divide its antisigma value perfectly, the antisigma expression modulo $n$ must equal 0:
    $$\frac{n(n+1)}{2} - \sigma(n) \equiv 0 \pmod n$$

    For any even number $n$, the formula for the sum of all integers up to $n$ expands to:

    $$\frac{n(n+1)}{2} = \frac{n^2}{2} + \frac{n}{2} = n\left(\frac{n}{2}\right) + \frac{n}{2}$$

    When this triangle number sum is divided by $n$, it consistently leaves a remainder of $\frac{n}{2}$. For the entire antisigma value to be perfectly divisible by $n$, the divisor sum $\sigma(n)$ must also leave a remainder of $\frac{n}{2}$ to exactly cancel out the first remainder. Algebraically, this requires:

    $$\sigma(n) = kn + \frac{n}{2}$$

    Dividing both sides by $n$ reveals the core ratio:

    $$\frac{\sigma(n)}{n} = k + 0.5$$

    Numbers whose abundancy index (the sum of their divisors divided by the number itself) equals a half-integer (such as 1.5, 2.5, or 3.5) belong to a specific mathematical class known as hemiperfect numbers.

    The Online Encyclopedia of Integer Sequences catalogs these half-integral abundancy numbers under OEIS A159907. The first five terms in this sequence are 2, 24, 4320, 4680, and 26208.

    The sequence does not end there. It continues into much larger integers that satisfy the exact same divisibility condition:

    • 8,910,720
    • 17,428,320
    • 20,427,264
    • 91,963,648
    • 197,064,960

    Because there is a massive mathematical "desert" spanning from 26,208 all the way to 8.9 million, a programmatic search capped at a 40,000 limit naturally halts after finding 26,208. Therefore, 24, 4320, 4680, and 26208 are not the only composite integers that divide their antisigma values evenly; they are simply the first four composite entries in a much larger, ongoing sequence.

    ************************

    I wrote about hemiperfect numbers in a post titled Hemiperfect Numbers on the 3rd of January 2021.

    Tuesday, 13 October 2026

    Perimeter of an Ellipse

    I remembered that there was no direct formula for the perimeter of an ellipse unlike the circle where the perimeter or circumference \(C\) is given by the formula \(C=\pi d\) where \(d\) is the diameter of the circle. I asked Gemini to explain the situation. What follows is Gemini's explanation and NOT mine.

    Unlike a circle (\(C = 2\pi r\)), there is no simple, exact algebraic formula for the perimeter (circumference) of an ellipse that uses only elementary functions. The exact perimeter can only be expressed using a mathematical concept known as an elliptic integral.

    However, there are several highly accurate approximations. The definitive way to calculate the perimeter of an ellipse practically is to use the exact integral for theoretical precision, or Srinivasa Ramanujan's first approximation for everyday calculation.

    To use these formulas, you must know two values:

    • \(a\): The semi-major axis (half the length of the longest diameter).
    • \(b\): The semi-minor axis (half the length of the shortest diameter).

    The Best Practical Approximation (Ramanujan)

    In 1914, the mathematician Srinivasa Ramanujan published a brilliant approximation that is incredibly accurate for most ellipses (unless they are extremely elongated, almost resembling a straight line). This is the formula you should use for almost any practical engineering or geometric application:

    \[ P \approx \pi \Big [ 3(a+b) - \sqrt{(3a+b)(a+3b)} \,\Big ] \]

    Example Calculation:
    If your ellipse has a semi-major axis \(a = 5\) and a semi-minor axis \(b = 3\):

    1. Calculate \(3(5+3) = 3(8) = 24\)
    2. Calculate \((3(5)+3)(5+3(3)) = (15+3)(5+9) = (18)(14) = 252\)
    3. Take the square root of 252: \(\sqrt{252} \approx 15.8745\)
    4. Subtract: \(24 - 15.8745 = 8.1255\)
    5. Multiply by \(\pi\): \(\pi \times 8.1255 \approx 25.527\)

    The perimeter is approximately \(25.527 \).

    The Exact Formula (For Absolute Precision)

    If you need the mathematically perfect answer, you must use the complete elliptic integral of the second kind. The exact formula is:

    \[ P = 4a \int_0^{\pi/2} \sqrt{1 - e^2 \sin^2 \theta} \, d\theta \]

    • \(a\) is the semi-major axis.
    • \(e\) is the eccentricity of the ellipse, defined as \(e = \sqrt{1 - \dfrac{b^2}{a^2}}\).

    Because this integral cannot be solved to give a simple polynomial or trigonometric function, it must be evaluated using numerical methods (which computers and advanced calculators do instantly). For the \(a=5, b=3\) example above, a computer evaluating the elliptic integral gives a perimeter of \(25.5269988 \dots \) showing just how incredibly accurate Ramanujan's approximation (25.527) is.

    Beyond 23

    The algorithm that I got Gemini to create and that I used in the post 23 Revisited was the result of the following prompt:

    Write a program in SageMath that determines all the composite, positive integers in a given range that contain the digits 2 and 3 in ascending order from left to right (but not necessarily consecutively) and whose prime factors also all contain the digits 2 and 3 in ascending order but not necessarily consecutively. The default range can be from 1 to 40000. The output should a table showing number and factors followed by a comma-separated list of the qualifying numbers.

    Instead of the prime 23, other prime numbers can be investigated. Composite numbers could be investigated too but this would lead to rather large numbers and so I'll restrict this investigation to prime numbers but I'll increase the range from 1 to one million.

    Here are the results for 11 (permalink):

    Number       | Prime Factors
    ------------------------------
    110231       | 11, 911
    111221       | 11, 10111
    112321       | 11, 10211
    117821       | 11, 10711
    128711       | 11, 11701
    129811       | 11, 11801
    131153       | 11, 11923
    131197       | 11, 11927
    171121       | 211, 811
    211321       | 11, 19211
    231121       | 11, 21011
    232111       | 11, 21101
    261143       | 113, 2311
    351119       | 311, 1129
    451121       | 11, 41011
    511621       | 11, 46511
    781121       | 11, 71011
    892111       | 11, 81101

    Here are the results for 13 (permalink):

    Number       | Prime Factors
    ------------------------------
    13169         | 13, 1013
    16913         | 13, 1301
    22139         | 13, 131
    113269       | 13, 8713
    131729       | 13, 10133
    131807       | 13, 10139
    132703       | 131, 1013
    134069       | 13, 10313
    136669       | 13, 10513
    137069       | 113, 1213
    137969       | 13, 10613
    138781       | 137, 1013
    147013       | 113, 1301
    161369       | 13, 12413
    169013       | 13, 13001
    171301       | 13, 13177
    171379       | 13, 13183
    172133       | 13, 13241
    180713       | 13, 13901
    190013       | 139, 1367
    211303       | 131, 1613
    313469       | 13, 24113
    313729       | 13, 24133
    313781       | 13, 24137
    360139       | 13, 2131
    407213       | 313, 1301
    413473       | 313, 1321
    421369       | 13, 32413
    661369       | 313, 2113
    797513       | 613, 1301
    813397       | 13, 4813
    813451       | 613, 1327

    Here are the results for 17 (permalink):

    Number       | Prime Factors
    ------------------------------
    51731         | 17, 179
    117589       | 17, 6917
    173009       | 17, 10177
    178313       | 17, 617
    198917       | 17, 11701
    217843       | 179, 1217
    291703       | 17, 17159
    295817       | 17, 17401
    301733       | 17, 17749
    308417       | 179, 1723
    351713       | 17, 1217
    368917       | 17, 21701
    506617       | 17, 1753
    517021       | 17, 1789
    541753       | 317, 1709
    717043       | 17, 42179

    Here, and finally, are the results for 19 (permalink):

    Number       | Prime Factors
    ------------------------------
    19361         | 19, 1019
    36119         | 19, 1901
    119467       | 193, 619
    121943       | 197, 619
    193667       | 19, 10193
    194629       | 191, 1019
    196667       | 193, 1019
    251929       | 191, 1319
    361019       | 19, 19001
    361969       | 19, 19051
    366719       | 19, 19301
    370519       | 19, 19501
    371963       | 19, 19577
    376219       | 19, 19801
    381947       | 193, 1979
    519329       | 191, 2719
    601967       | 193, 3119
    714419       | 19, 1979
    719473       | 19, 1993
    752419       | 19, 199
    796519       | 419, 1901

    I won't continue with primes larger than 23 because really what I want is an algorithm that will identify a sequence of digits that form a prime within a number and then check that the same digit sequence occurs with each of its prime factors. The number being checked is thus composite. Here is a permalink to the program that I've now included in my daily number analysis.