27335 is a member of OEIS A020700: numbers k such that k + sum of its prime factors = (k+1) + sum of its prime factors. There are 37 such numbers in the range up to 40000. The sequence can be generated using the following code:

INPUT

def primesum(n):

  F=list(factor(n))

  primesum=0

  for f in F:

    primesum+=f[0]*f[1]

  return primesum

L=[]

for n in [1..40000]:

  if n+primesum(n)==(n+1)+primesum(n+1):

    L.append(n)

print(L)

print(len(L))

OUTPUT

[7, 14, 63, 80, 224, 285, 351, 363, 475, 860, 902, 1088, 1479, 2013, 2023, 3478, 3689, 3925, 5984, 6715, 8493, 9456, 13224, 15520, 17227, 18569, 19502, 20490, 21804, 24435, 24476, 27335, 31899, 32390, 35815, 37406, 37582]

37

27335 is a Duffinian number.