3,744,256
29 × 71 × 103
Abundant
Even
Composite
3,744,256 factors as 2^9 × 71 × 103. Its 40 positive divisors give a proper-divisor sum of 3,915,968, so this integer is abundant. The Collatz stopping time is 128 steps.
Prime Factor Structure
Factorization String
2^9 × 71 × 103
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
7,660,224
Proper Divisor Sum
3,915,968
Digit Sum / Digital Root
31 (Root: 4)
Radix Representation
| Decimal | 3744256 |
| Binary | 1110010010001000000000 (22 bits) |
| Octal | 0o16221000 |
| Hexadecimal | 0x392200 |
Divisor Catalog (40)
Collatz Trajectory (128 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.