9,315,405
35 × 5 × 11 × 17 × 41
Abundant
Odd
Composite
9,315,405 factors as 3^5 × 5 × 11 × 17 × 41. Its 96 positive divisors give a proper-divisor sum of 10,497,843, so this integer is abundant. The Collatz stopping time is 225 steps.
Prime Factor Structure
Factorization String
3^5 × 5 × 11 × 17 × 41
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
96
Divisor Sum (σ)
19,813,248
Proper Divisor Sum
10,497,843
Digit Sum / Digital Root
27 (Root: 9)
Adjacent Primes
#9315367 ← → #9315419
Radix Representation
| Decimal | 9315405 |
| Binary | 100011100010010001001101 (24 bits) |
| Octal | 0o43422115 |
| Hexadecimal | 0x8E244D |
Divisor Catalog (60 of 96)
Collatz Trajectory (225 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):