2,724,366
2 × 3 × 454061
Abundant
Even
Composite
2,724,366 factors as 2 × 3 × 454061. Its 8 positive divisors give a proper-divisor sum of 2,724,378, so this integer is abundant. The Collatz stopping time is 107 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 454061
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
5,448,744
Proper Divisor Sum
2,724,378
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#2724329 ← → #2724367
Radix Representation
| Decimal | 2724366 |
| Binary | 1010011001001000001110 (22 bits) |
| Octal | 0o12311016 |
| Hexadecimal | 0x29920E |
Divisor Catalog (5 of 8)
Collatz Trajectory (107 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.