4,495,920
24 × 3 × 5 × 11 × 13 × 131
Abundant
Even
Composite
4,495,920 factors as 2^4 × 3 × 5 × 11 × 13 × 131. Its 160 positive divisors give a proper-divisor sum of 12,003,024, so this integer is abundant. The Collatz stopping time is 110 steps.
Prime Factor Structure
Factorization String
2^4 × 3 × 5 × 11 × 13 × 131
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
160
Divisor Sum (σ)
16,498,944
Proper Divisor Sum
12,003,024
Digit Sum / Digital Root
33 (Root: 6)
Radix Representation
| Decimal | 4495920 |
| Binary | 10001001001101000110000 (23 bits) |
| Octal | 0o21115060 |
| Hexadecimal | 0x449A30 |
Divisor Catalog (60 of 160)
Collatz Trajectory (110 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.