Permutations of Symbols Within a String

This program computes the EXACT number of unique permutations, completely different linear
rearrangements, that can be created from a string of symbols or alpha-numeric text characters.

Any symbol character repetitions are also taken properly into account.


Given the symbol or character string:

33662w8K6H8qV

------------------------------------------------
STATISTICAL SYNOPSIS OF THE GIVEN SYMBOLS STRING

 CHAR    TXT       CHAR CODE
COUNTS  CHARS      DEC   HEX
------  -----     -----------
  1 	  2 	   050	  32
  2 	  3 	   051	  33
  3 	  6 	   054	  36
  2 	  8 	   056	  38
  1 	  H 	   072	  48
  1 	  K 	   075	  4B
  1 	  V 	   086	  56
  1 	  q 	   113	  71
  1 	  w 	   119	  77
------  -----     -----------
 CHAR    TXT       DEC   HEX
COUNTS  CHARS      CHAR CODE


Total  characters count: 13
Unique characters count: 6

----------------------------------------------------
The EXACT count of the total number of unique symbol
permutations within the given string equates to:

259459200

= 9 digits
----------------------------------------------------
The formal long name for the 9-digit number of per-
mutations computed above is read as follows:

259 million
459 thousand
200