4,647,136
25 × 13 × 11171
Abundant
Even
Composite
4,647,136 factors as 2^5 × 13 × 11171. Its 24 positive divisors give a proper-divisor sum of 5,206,568, so this integer is abundant. The Collatz stopping time is 162 steps.
Prime Factor Structure
Factorization String
2^5 × 13 × 11171
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
9,853,704
Proper Divisor Sum
5,206,568
Digit Sum / Digital Root
31 (Root: 4)
Radix Representation
| Decimal | 4647136 |
| Binary | 10001101110100011100000 (23 bits) |
| Octal | 0o21564340 |
| Hexadecimal | 0x46E8E0 |
Divisor Catalog (24)
Collatz Trajectory (162 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.