3,658,650
2 × 3 × 52 × 24391
Abundant
Even
Composite
3,658,650 factors as 2 × 3 × 5^2 × 24391. Its 24 positive divisors give a proper-divisor sum of 5,415,174, so this integer is abundant. The Collatz stopping time is 141 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5^2 × 24391
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
9,073,824
Proper Divisor Sum
5,415,174
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#3658639 ← → #3658661
Radix Representation
| Decimal | 3658650 |
| Binary | 1101111101001110011010 (22 bits) |
| Octal | 0o15751632 |
| Hexadecimal | 0x37D39A |
Divisor Catalog (5 of 24)
Collatz Trajectory (141 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.