6,000,258
2 × 3 × 11 × 229 × 397
Abundant
Even
Composite
6,000,258 factors as 2 × 3 × 11 × 229 × 397. Its 32 positive divisors give a proper-divisor sum of 7,181,502, so this integer is abundant. The Collatz stopping time is 152 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 11 × 229 × 397
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
13,181,760
Proper Divisor Sum
7,181,502
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#6000233 ← → #6000271
Radix Representation
| Decimal | 6000258 |
| Binary | 10110111000111010000010 (23 bits) |
| Octal | 0o26707202 |
| Hexadecimal | 0x5B8E82 |
Divisor Catalog (5 of 32)
Collatz Trajectory (152 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.