11,382,000
24 × 3 × 53 × 7 × 271
Abundant
Even
Composite
11,382,000 factors as 2^4 × 3 × 5^3 × 7 × 271. Its 160 positive divisors give a proper-divisor sum of 30,710,544, so this integer is abundant. The Collatz stopping time is 158 steps.
Prime Factor Structure
Factorization String
2^4 × 3 × 5^3 × 7 × 271
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
160
Divisor Sum (σ)
42,092,544
Proper Divisor Sum
30,710,544
Digit Sum / Digital Root
15 (Root: 6)
Radix Representation
| Decimal | 11382000 |
| Binary | 101011011010110011110000 (24 bits) |
| Octal | 0o53326360 |
| Hexadecimal | 0xADACF0 |
Divisor Catalog (60 of 160)
Collatz Trajectory (158 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.