11,645,112
23 × 3 × 467 × 1039
Abundant
Even
Composite
11,645,112 factors as 2^3 × 3 × 467 × 1039. Its 32 positive divisors give a proper-divisor sum of 17,558,088, so this integer is abundant. The Collatz stopping time is 184 steps.
Prime Factor Structure
Factorization String
2^3 × 3 × 467 × 1039
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
29,203,200
Proper Divisor Sum
17,558,088
Digit Sum / Digital Root
21 (Root: 3)
Radix Representation
| Decimal | 11645112 |
| Binary | 101100011011000010111000 (24 bits) |
| Octal | 0o54330270 |
| Hexadecimal | 0xB1B0B8 |
Divisor Catalog (32)
Collatz Trajectory (184 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.
No other profiles in this collection.