9,109,408
25 × 7 × 11 × 3697
Abundant
Even
Composite
9,109,408 factors as 2^5 × 7 × 11 × 3697. Its 48 positive divisors give a proper-divisor sum of 13,256,096, so this integer is abundant. The Collatz stopping time is 132 steps.
Prime Factor Structure
Factorization String
2^5 × 7 × 11 × 3697
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
22,365,504
Proper Divisor Sum
13,256,096
Digit Sum / Digital Root
31 (Root: 4)
Radix Representation
| Decimal | 9109408 |
| Binary | 100010101111111110100000 (24 bits) |
| Octal | 0o42577640 |
| Hexadecimal | 0x8AFFA0 |
Divisor Catalog (48)
Collatz Trajectory (132 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.