1,541,742
2 × 3 × 256957
Abundant
Even
Composite
1,541,742 factors as 2 × 3 × 256957. Its 8 positive divisors give a proper-divisor sum of 1,541,754, so this integer is abundant. The Collatz stopping time is 150 steps.
Prime Factor Structure
Factorization String
2 × 3 × 256957
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
3,083,496
Proper Divisor Sum
1,541,754
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#1541731 ← → #1541773
Radix Representation
| Decimal | 1541742 |
| Binary | 101111000011001101110 (21 bits) |
| Octal | 0o5703156 |
| Hexadecimal | 0x17866E |
Divisor Catalog (8)
Collatz Trajectory (150 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):