How to make my program more efficient and minimize steps

python

#1

list_1 = [181, 191, 211, 241, 251, 271, 281, 311, 331,
401, 421, 431, 461, 491, 521, 541, 571, 601, 631]

list_2 = []
list_4 = []
list_6 = []
list_8 = []
list_10 = []
list_g = []

original list

print list_1
print

place holder for functions performed against original list

for x in list_1:
list_2.append(x + 2)
print list_2
print
for x in list_1:
list_4.append(x + 4)
print list_4
print
for x in list_1:
list_6.append(x + 6)
print list_6
print
for x in list_1:
list_8.append(x + 8)
print list_8
print
for x in list_1:
list_10.append(x + 10)
print list_10
print

Add lists to list_c

list_c = []
list_d = []
for x in list_1:
list_c.append(x)
for x in list_2:
list_c.append(x)
for x in list_4:
list_c.append(x)
for x in list_6:
list_c.append(x)
for x in list_8:
list_c.append(x)
for x in list_10:
list_c.append(x)

remove duplicates and append to list_d

for x in list(set(list_c)):
list_d.append(x)

print
print list_d
print

Check list for primes then append them to list_e

list_e = []

for x in list_d:
num = x
if num > 1:
for i in range(2,num):
if (num % i) == 0:
break
else:
list_e.append(num)

prints a sorted list

else:
print sorted(list_e)
a = int(list_e[-1])
print
print
print
print list_e.index(a)


#2

I am using python 3, so I added ( ) in print