Minimum base to count to a string The Challenge
Input: alphanumeric string. You can assume that the string will only contain the characters [0-9A-Z]. This can come from a parameter, command line, or STDIN. Digits are always before letters in terms of the base. Think like an extended version of HEX.
Output X,Y Such that Y is the minimum base required to parse the string and X is the decimal value of the input string in that base.
Examples

Input: &quot;1&quot;
Output: 1,2



Input: &quot;HELLOWORLD&quot;
Output: 809608041709942,33

Scoring: This is a golf, so shortest code in bytes wins.
Python 2, 74 64 56 55 53 bytes



def f(x):a=ord(max(x))-54;a+=7*(a&lt;8);print int(x,a),a


Call the function (i.e. f("HELLOWORLD")) and outputs to stdout (809608041709942 33)

This is case-sensitive, requiring upper case letters, and crashes for invalid input (e.g. "$^$%!(&amp;£%)())

This code gets the max letter in the string (z>x>y>...>b>a>9>8>...>2>1>0) and gets the largest base needed to represent it.

Change the 54 into a 76 to make it work for lowercase (but no longer upper case).