7,800,294
2 × 3 × 1063 × 1223
Abundant
Even
Composite
7,800,294 factors as 2 × 3 × 1063 × 1223. Its 16 positive divisors give a proper-divisor sum of 7,827,738, so this integer is abundant. The Collatz stopping time is 155 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 1063 × 1223
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
15,628,032
Proper Divisor Sum
7,827,738
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#7800281 ← → #7800307
Radix Representation
| Decimal | 7800294 |
| Binary | 11101110000010111100110 (23 bits) |
| Octal | 0o35602746 |
| Hexadecimal | 0x7705E6 |
Divisor Catalog (5 of 16)
Collatz Trajectory (155 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.