2,247,294
2 × 3 × 7 × 53507
Abundant
Even
Composite
2,247,294 factors as 2 × 3 × 7 × 53507. Its 16 positive divisors give a proper-divisor sum of 2,889,474, so this integer is abundant. The Collatz stopping time is 161 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 7 × 53507
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
5,136,768
Proper Divisor Sum
2,889,474
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#2247293 ← → #2247337
Radix Representation
| Decimal | 2247294 |
| Binary | 1000100100101001111110 (22 bits) |
| Octal | 0o10445176 |
| Hexadecimal | 0x224A7E |
Divisor Catalog (5 of 16)
Collatz Trajectory (161 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.