27422 is the larger of two consecutive semiprimes whose prime factors both contain three or more 1's. The sequence can be generated as follows:

INPUT

L=[]

number=1

for n in [1..40000]:

  if len(divisors(n))==4 and len(prime_factors(n))==2:

    F=prime_factors(n)

    total=F[0].digits().count(number)+F[1].digits().count(number)

    if total>=3:

      L.append(n)

P=[]

for i in range(len(L)-1):

  if L[i+1]-L[i]==1:

    P.append((L[i],L[i+1]))

print(P)

print(len(P))

OUTPUT

[(20281, 20282), (20422, 20423), (22261, 22262), (22633, 22634), (23242, 23243), (24322, 24323), (25021, 25022), (27421, 27422), (34233, 34234), (35821, 35822), (35822, 35823)]

11

27422 is a self and untouchable number.

27422 can be turned into a digit equation as follows:

2 * 7 = 4 ^ 2 - 2

27422 stabilises after almost 100 generations of Conway's Game of Life Rules to a traffic light oscillator, two blinkers (oscillators) and a single still life block.