How many permutations of an alphanumeric string of length 32 [closed]

Question

Considering using the characters (elements) a-z and 0-9 how many different permutations are there when using a string of length 32?

The elements can be used more than once, but the results have to be unique (as is the case with a permutation).

I've looked at WolframAlpha however that doesn't state how many 'elements' that would be used, it only considers the length.

Answer 1

You have 32 positions for either 10 different digits or 26 characters. In each position either goes a character or a digit so you have 36 possibilities. This leave us with:

36*36*36...*36 (32 times)
= 36^32
= 63340286662973277706162286946811886609896461828096 # (thanks Python ;) )

Answer 2

The answer is (26+10)^32 = 6.3340287e+49