3,438,656
26 × 13 × 4133
Abundant
Even
Composite
3,438,656 factors as 2^6 × 13 × 4133. Its 28 positive divisors give a proper-divisor sum of 3,911,596, so this integer is abundant. The Collatz stopping time is 221 steps.
Resources
Prime Factor Structure
Factorization String
2^6 × 13 × 4133
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
28
Divisor Sum (σ)
7,350,252
Proper Divisor Sum
3,911,596
Digit Sum / Digital Root
35 (Root: 8)
Adjacent Primes
#3438649 ← → #3438671
Radix Representation
| Decimal | 3438656 |
| Binary | 1101000111100001000000 (22 bits) |
| Octal | 0o15074100 |
| Hexadecimal | 0x347840 |
Divisor Catalog (5 of 28)
Collatz Trajectory (221 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
Showing the first 5 trajectory entries; the stopping-time total above is unchanged.