4,994,538
2 × 3 × 41 × 79 × 257
Abundant
Even
Composite
4,994,538 factors as 2 × 3 × 41 × 79 × 257. Its 32 positive divisors give a proper-divisor sum of 5,408,022, so this integer is abundant. The Collatz stopping time is 69 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 41 × 79 × 257
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
10,402,560
Proper Divisor Sum
5,408,022
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#4994513 ← → #4994543
Radix Representation
| Decimal | 4994538 |
| Binary | 10011000011010111101010 (23 bits) |
| Octal | 0o23032752 |
| Hexadecimal | 0x4C35EA |
Divisor Catalog (5 of 32)
Collatz Trajectory (69 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.