from fnmatch import *

sd = []

for i in range (1,20):

sd.append(2**i)

for x in range(0, 10**9, 31*2031):

if fnmatch(str(x), '*31*65?'):

delitel = []

for i in range(1, round (x**0.5) + 1):

if x%i==0:

delitel.append(i)

delitel.append(x // i)

if len(delitel) in sd:

print(x, x // 2031)

from fnmatch import *

for i in range(0,10**9+1,2031):

if fnmatch(str(i),'*31*65?') and i%31==0:

d=[]

for j in range(1,int(i**0.5)+1):

if i%j==0:

d.append(j)

if j!=(i//j):

d.append(i//j)

for x in range(100):

if len(d)==2**x:

print(i,i//2031)

break

import math

for i in range(0, 10**9, math.lcm(31, 2031)): #Для python 3.8 и рань­ше: for i in range(0, 10**9, abs(31*2031)//math.gcd(31, 2031), 2):

s = str(i)

if s[::-1][1:3] == '56' and '13' in s[::-1][3:]:

divCount = 1

for d in range(2, math.floor(math.sqrt(i))+1):

if i%d == 0:

divCount+=1

if divCount in [2**t for t in range(1, math.ceil(9*math.log2(10)))]: #10**9 >= 2**x <=> x <= 9*log₂10

print(i, i//2031)

import fnmatch,math

def deliteli(n):

d=set()

k=1

while k**2<=n:

if n%k==0: d|={k,n//k}

k+=1

return sorted(d)

twopower=[2**n for n in range(100)]

for n in range(0,10**9,31*2031//math.gcd(31,2031)):# шаг цикла - наи­мень­шее общее крат­ное

if fnmatch.fnmatch(str(n),'*31*65?') and len(deliteli(n)) in twopower:

print(n,n//2031)