501,150
2 × 3 × 52 × 13 × 257
Abundant
Even
Composite
501,150 factors as 2 × 3 × 5^2 × 13 × 257. Its 48 positive divisors give a proper-divisor sum of 842,514, so this integer is abundant. The Collatz stopping time is 89 steps.
Prime Factor Structure
Factorization String
2 × 3 × 5^2 × 13 × 257
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
1,343,664
Proper Divisor Sum
842,514
Digit Sum / Digital Root
12 (Root: 3)
Radix Representation
| Decimal | 501150 |
| Binary | 1111010010110011110 (19 bits) |
| Octal | 0o1722636 |
| Hexadecimal | 0x7A59E |
Divisor Catalog (48)
Collatz Trajectory (89 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.