9,677,920
25 × 5 × 7 × 8641
Abundant
Even
Composite
9,677,920 factors as 2^5 × 5 × 7 × 8641. Its 48 positive divisors give a proper-divisor sum of 16,455,488, so this integer is abundant. The Collatz stopping time is 70 steps.
Prime Factor Structure
Factorization String
2^5 × 5 × 7 × 8641
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
26,133,408
Proper Divisor Sum
16,455,488
Digit Sum / Digital Root
40 (Root: 4)
Radix Representation
| Decimal | 9677920 |
| Binary | 100100111010110001100000 (24 bits) |
| Octal | 0o44726140 |
| Hexadecimal | 0x93AC60 |
Divisor Catalog (48)
Collatz Trajectory (70 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.