9,044,992
210 × 112 × 73
Abundant
Even
Composite
9,044,992 factors as 2^10 × 11^2 × 73. Its 66 positive divisors give a proper-divisor sum of 11,101,582, so this integer is abundant. The Collatz stopping time is 88 steps.
Prime Factor Structure
Factorization String
2^10 × 11^2 × 73
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
66
Divisor Sum (σ)
20,146,574
Proper Divisor Sum
11,101,582
Digit Sum / Digital Root
37 (Root: 1)
Radix Representation
| Decimal | 9044992 |
| Binary | 100010100000010000000000 (24 bits) |
| Octal | 0o42402000 |
| Hexadecimal | 0x8A0400 |
Divisor Catalog (60 of 66)
Collatz Trajectory (88 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.