4,633,098
2 × 3 × 29 × 26627
Abundant
Even
Composite
4,633,098 factors as 2 × 3 × 29 × 26627. Its 16 positive divisors give a proper-divisor sum of 4,952,982, so this integer is abundant. The Collatz stopping time is 211 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 29 × 26627
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
9,586,080
Proper Divisor Sum
4,952,982
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#4633067 ← → #4633141
Radix Representation
| Decimal | 4633098 |
| Binary | 10001101011001000001010 (23 bits) |
| Octal | 0o21531012 |
| Hexadecimal | 0x46B20A |
Divisor Catalog (5 of 16)
Collatz Trajectory (211 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.