1,541,670
2 × 3 × 5 × 13 × 59 × 67
Abundant
Even
Composite
1,541,670 factors as 2 × 3 × 5 × 13 × 59 × 67. Its 64 positive divisors give a proper-divisor sum of 2,570,970, so this integer is abundant. The Collatz stopping time is 150 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 13 × 59 × 67
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
4,112,640
Proper Divisor Sum
2,570,970
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#1541663 ← → #1541671
Radix Representation
| Decimal | 1541670 |
| Binary | 101111000011000100110 (21 bits) |
| Octal | 0o5703046 |
| Hexadecimal | 0x178626 |
Divisor Catalog (5 of 64)
Collatz Trajectory (150 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.