3,419,736
23 × 3 × 89 × 1601
Abundant
Even
Composite
3,419,736 factors as 2^3 × 3 × 89 × 1601. Its 32 positive divisors give a proper-divisor sum of 5,231,064, so this integer is abundant. The Collatz stopping time is 76 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 89 × 1601
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
8,650,800
Proper Divisor Sum
5,231,064
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#3419711 ← → #3419777
Radix Representation
| Decimal | 3419736 |
| Binary | 1101000010111001011000 (22 bits) |
| Octal | 0o15027130 |
| Hexadecimal | 0x342E58 |
Divisor Catalog (5 of 32)
Collatz Trajectory (76 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.