3,136,656
24 × 3 × 101 × 647
Abundant
Even
Composite
3,136,656 factors as 2^4 × 3 × 101 × 647. Its 40 positive divisors give a proper-divisor sum of 5,059,248, so this integer is abundant. The Collatz stopping time is 164 steps.
Prime Factor Structure
Factorization String
2^4 × 3 × 101 × 647
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
8,195,904
Proper Divisor Sum
5,059,248
Digit Sum / Digital Root
30 (Root: 3)
Radix Representation
| Decimal | 3136656 |
| Binary | 1011111101110010010000 (22 bits) |
| Octal | 0o13756220 |
| Hexadecimal | 0x2FDC90 |
Divisor Catalog (40)
Collatz Trajectory (164 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.