50,016
25 × 3 × 521
Abundant
Even
Composite
50,016 factors as 2^5 × 3 × 521. Its 24 positive divisors give a proper-divisor sum of 81,528, so this integer is abundant. The Collatz stopping time is 158 steps.
Prime Factor Structure
Factorization String
2^5 × 3 × 521
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
131,544
Proper Divisor Sum
81,528
Digit Sum / Digital Root
12 (Root: 3)
Radix Representation
| Decimal | 50016 |
| Binary | 1100001101100000 (16 bits) |
| Octal | 0o141540 |
| Hexadecimal | 0xC360 |
Divisor Catalog (24)
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.