61,568
27 × 13 × 37
Abundant
Even
Composite
61,568 factors as 2^7 × 13 × 37. Its 32 positive divisors give a proper-divisor sum of 74,092, so this integer is abundant. The Collatz stopping time is 55 steps.
Resources
Prime Factor Structure
Factorization String
2^7 × 13 × 37
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
135,660
Proper Divisor Sum
74,092
Digit Sum / Digital Root
26 (Root: 8)
Adjacent Primes
#61561 ← → #61583
Radix Representation
| Decimal | 61568 |
| Binary | 1111000010000000 (16 bits) |
| Octal | 0o170200 |
| Hexadecimal | 0xF080 |
Divisor Catalog (5 of 32)
Collatz Trajectory (55 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.