27433 is a member of OEIS A115933: numbers k such that k^3 contains a pandigital substring. The sequence can be generated as follows (permalink):

INPUT

L=[]

P=["0","1","2","3","4","5","6","7","8","9"]

for n in [1..40000]:

  cube=list(str(n^3))

  for i in range(0,len(cube)-9):

    M=[]

    for j in [i..i+9]:

      M.append(cube[j])

    if sorted(M)==sorted(P):

      L.append(n)

print(L)

OUTPUT

[2326, 3909, 5196, 5402, 7061, 7616, 8402, 8496, 8499, 9048, 13565, 15194, 15298, 15841, 19304, 19429, 20516, 21669, 23260, 23572, 23875, 23936, 24299, 24772, 24952, 25182, 25281, 26139, 26499, 26602, 26818, 26832, 27287, 27433, 27757, 27927, 30131, 30240, 30667, 31196, 31818, 32186, 32769, 32857, 33344, 33486, 33667, 35692, 36893, 36943, 37046, 37802, 37802, 38025, 38025, 38027, 38281, 39090, 39312]

27433 is a cyclic number.

27433 is a d-powerful number because it can be written as 2^13 + 7^5 + 4 + 3^5 + 3^7 .

27433 is a self number because there is not a number n which added to its sum of digits gives 27433.

27433 can be rendered as a digit equation as follows:

-2 + 7 + 4 = 3 * 3

27433 stabilises after about 90 generations of Conway's Game of Life to a blinker and two still life shapes.