27675 is a member of OEIS A098743: number of partitions of n into aliquant parts (parts that do not divide n). This can be confirmed using the following algorithm:

INPUT

number = 55

P=Partitions(number)

print(len(P))

count=0

for p in P:

  OK=1

  for i in range(len(p)):

    if (p[i]==1 or p[i]==number) or (p[i]==5 or p[i]==11):

      OK=0

      break

  if OK==1:

    count+=1

print(count)

OUTPUT

451276

27675

27675 is a palindromic in base 2 (110110000011011).

27675 is a nialdrome in base 15 (8300).

27675 is a gapful number since it is divisible by the number (25) formed by its first and last digit.

27675 is a Harshad number since it is a multiple of its sum of digits (27).

27675 has a product of digits (2940) that is a multiple of the sum of its prime divisors (49).

27675 is a is not an unprimeable number, because it can be changed into a prime (27673) by changing a digit.

27675 can be rendered as a digit equation as follows:

2 ^ (7 - 6) = 7 - 5