5,653,980
22 × 32 × 5 × 101 × 311
Abundant
Even
Composite
5,653,980 factors as 2^2 × 3^2 × 5 × 101 × 311. Its 72 positive divisors give a proper-divisor sum of 11,721,924, so this integer is abundant. The Collatz stopping time is 108 steps.
Prime Factor Structure
Factorization String
2^2 × 3^2 × 5 × 101 × 311
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
72
Divisor Sum (σ)
17,375,904
Proper Divisor Sum
11,721,924
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#5653957 ← → #5653993
Radix Representation
| Decimal | 5653980 |
| Binary | 10101100100010111011100 (23 bits) |
| Octal | 0o25442734 |
| Hexadecimal | 0x5645DC |
Divisor Catalog (60 of 72)
Collatz Trajectory (108 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):