3,054,702
2 × 3 × 7 × 257 × 283
Abundant
Even
Composite
3,054,702 factors as 2 × 3 × 7 × 257 × 283. Its 32 positive divisors give a proper-divisor sum of 3,979,410, so this integer is abundant. The Collatz stopping time is 319 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 7 × 257 × 283
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
7,034,112
Proper Divisor Sum
3,979,410
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#3054691 ← → #3054703
Radix Representation
| Decimal | 3054702 |
| Binary | 1011101001110001101110 (22 bits) |
| Octal | 0o13516156 |
| Hexadecimal | 0x2E9C6E |
Divisor Catalog (5 of 32)
Collatz Trajectory (319 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.