Word Length-Sum Multiples A port of my other question: Double Prime Words
Consider a word/string of n alphanumeric characters with sum of the characters, s, using their numeric position in the alphabet (a=1, B=2, c=3, etc.) or numeric value (0,1, 2, 3 - 9). Numeric characters should be taken at individual value. (66 is two 6 characters for a sum of 12)
A word is a Length-Sum Multiple if and only if s is a multiple of n, specifically s/n is a positive integer {1,2,3,4...}. In the case of s=0, and n={0,00,000,...}, 0 is a multiple of any n but it does not yield a positive integer. Hence an input of {0,00,000,...} is False.
Input can be any combination of numbers and upper or lower case alphabetic characters, as there is no numeric difference between a or A. Handling empty input, n=s=0, is not required.
Output is any appropriate logical format related to your language. i.e. True or False, T or F, 1 or 0, positive for truthy and 0 for falsy, etc. Specifying what format your output will appear is highly appreciated, but not required. (Output need not include n or s, but I include them below as demonstration and example)
Winning condition: In as few bytes as possible, write a function that is able to determine if a string is a Length-Sum Multiple.
Examples
Input -&gt; Output (n,s) 

hello -&gt; False (5, 52) 
MuLtIpLe -&gt; False (8, 108)
Junct10n -&gt; False (8, 83)
Order66 -&gt; False (7, 72)
CodeGolf -&gt; False (8, 67)
SUM -&gt; False (3, 53)
ID -&gt; False (2, 13)

25 -&gt; False (2, 7)
0 -&gt; False (1, 0) 0/1 = 0 which is not a positive integer
10 -&gt; False (2, 1) 

hello2 -&gt; True (6, 54)
5um -&gt; True (3, 39)
length -&gt; True (6, 66)
Order64 -&gt; True (7, 70)
Covid19 -&gt; True (7, 63)
Word -&gt; True (4, 60)
APPLE -&gt; True (5, 50)
lawYER -&gt; True (6, 84)
abc123 -&gt; True (6, 12)
is -&gt; True (2, 28)
television -&gt; True (10, 130)
19 -&gt; True (2, 10)
234 -&gt; True (3, 9)

a -&gt; True (1, 1)
b -&gt; True (1, 2)
C -&gt; True (1, 3)
Z -&gt; True (1, 26)
1 -&gt; True (1, 1)
9 -&gt; True (1, 9)
05AB1E, 16 15 bytes
þIáÇ32%«ODXgÖ*Ā

Input as a list of characters.
-1 byte implicitly thanks to @ovs.
Try it online or verify all test cases.
Explanation:

þ                # Only leave the digits of the (implicit) input-list
 Iá              # Push the input-list again, and only leave its letters
   Ç             # Convert each letter to its codepoint integer
    32%          # Take modulo-32 on each codepoint
       «         # Merge it to the list of digits
        O        # Sum this list
         D       # Duplicate this sum
          Ig     # Push the input-list again, and pop and push its length
            Ö    # Check if the sum is divisible by this length
             *   # Multiply it by the duplicated sum
              Ā  # And check that this is NOT 0
                 # (after which the result is output implicitly)

3 bytes (D*Ā) are used for edge-cases 0/00/000/etc.