168,280
23 × 5 × 7 × 601
Abundant
Even
Composite
168,280 factors as 2^3 × 5 × 7 × 601. Its 32 positive divisors give a proper-divisor sum of 265,160, so this integer is abundant. The Collatz stopping time is 33 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 5 × 7 × 601
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
433,440
Proper Divisor Sum
265,160
Digit Sum / Digital Root
25 (Root: 7)
Adjacent Primes
#168277 ← → #168281
Radix Representation
| Decimal | 168280 |
| Binary | 101001000101011000 (18 bits) |
| Octal | 0o510530 |
| Hexadecimal | 0x29158 |
Divisor Catalog (5 of 32)
Collatz Trajectory (33 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.