5,684,640
25 × 3 × 5 × 13 × 911
Abundant
Even
Composite
5,684,640 factors as 2^5 × 3 × 5 × 13 × 911. Its 96 positive divisors give a proper-divisor sum of 13,620,576, so this integer is abundant. The Collatz stopping time is 214 steps.
Prime Factor Structure
Factorization String
2^5 × 3 × 5 × 13 × 911
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
96
Divisor Sum (σ)
19,305,216
Proper Divisor Sum
13,620,576
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#5684639 ← → #5684641
Radix Representation
| Decimal | 5684640 |
| Binary | 10101101011110110100000 (23 bits) |
| Octal | 0o25536640 |
| Hexadecimal | 0x56BDA0 |
Divisor Catalog (60 of 96)
Collatz Trajectory (214 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):