395,560
23 × 5 × 11 × 29 × 31
Abundant
Even
Composite
395,560 factors as 2^3 × 5 × 11 × 29 × 31. Its 64 positive divisors give a proper-divisor sum of 641,240, so this integer is abundant. The Collatz stopping time is 99 steps.
Prime Factor Structure
Factorization String
2^3 × 5 × 11 × 29 × 31
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
1,036,800
Proper Divisor Sum
641,240
Digit Sum / Digital Root
28 (Root: 1)
Radix Representation
| Decimal | 395560 |
| Binary | 1100000100100101000 (19 bits) |
| Octal | 0o1404450 |
| Hexadecimal | 0x60928 |
Divisor Catalog (60 of 64)
Collatz Trajectory (99 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.
No other profiles in this collection.