4,305,496
23 × 13 × 41399
Abundant
Even
Composite
4,305,496 factors as 2^3 × 13 × 41399. Its 16 positive divisors give a proper-divisor sum of 4,388,504, so this integer is abundant. The Collatz stopping time is 74 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 13 × 41399
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
8,694,000
Proper Divisor Sum
4,388,504
Digit Sum / Digital Root
31 (Root: 4)
Adjacent Primes
#4305491 ← → #4305523
Radix Representation
| Decimal | 4305496 |
| Binary | 10000011011001001011000 (23 bits) |
| Octal | 0o20331130 |
| Hexadecimal | 0x41B258 |
Divisor Catalog (5 of 16)
Collatz Trajectory (74 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.