6,012,234
2 × 32 × 211 × 1583
Abundant
Even
Composite
6,012,234 factors as 2 × 3^2 × 211 × 1583. Its 24 positive divisors give a proper-divisor sum of 7,084,278, so this integer is abundant. The Collatz stopping time is 165 steps.
Prime Factor Structure
Factorization String
2 × 3^2 × 211 × 1583
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
13,096,512
Proper Divisor Sum
7,084,278
Digit Sum / Digital Root
18 (Root: 9)
Adjacent Primes
#6012229 ← → #6012239
Radix Representation
| Decimal | 6012234 |
| Binary | 10110111011110101001010 (23 bits) |
| Octal | 0o26736512 |
| Hexadecimal | 0x5BBD4A |
Divisor Catalog (24)
Collatz Trajectory (165 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):