3,564,088
23 × 11 × 101 × 401
Abundant
Even
Composite
3,564,088 factors as 2^3 × 11 × 101 × 401. Its 32 positive divisors give a proper-divisor sum of 3,816,632, so this integer is abundant. The Collatz stopping time is 190 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 11 × 101 × 401
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
7,380,720
Proper Divisor Sum
3,816,632
Digit Sum / Digital Root
34 (Root: 7)
Adjacent Primes
#3564073 ← → #3564097
Radix Representation
| Decimal | 3564088 |
| Binary | 1101100110001000111000 (22 bits) |
| Octal | 0o15461070 |
| Hexadecimal | 0x366238 |
Divisor Catalog (5 of 32)
Collatz Trajectory (190 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.