You are given a positive integer n. Your task is to return its total number of positive divisors, including 1 and n itself.
Input: n = 12
Output: 6
Explanation: The positive divisors of 12 are 1, 2, 3, 4, 6, and 12. Therefore, the total number of divisors is 6.
Input: n = 7
Output: 2
Explanation: Since 7 is prime, its only positive divisors are 1 and 7. Therefore, the count is 2.
Input: n = 1
Output: 1
Explanation: The number 1 has exactly one positive divisor: 1.
Sign in to write, run, and submit your solution against the full test suite.
