3,900,568
23 × 7 × 69653
Abundant
Even
Composite
3,900,568 factors as 2^3 × 7 × 69653. Its 16 positive divisors give a proper-divisor sum of 4,457,912, so this integer is abundant. The Collatz stopping time is 154 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 7 × 69653
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
8,358,480
Proper Divisor Sum
4,457,912
Digit Sum / Digital Root
31 (Root: 4)
Adjacent Primes
#3900563 ← → #3900569
Radix Representation
| Decimal | 3900568 |
| Binary | 1110111000010010011000 (22 bits) |
| Octal | 0o16702230 |
| Hexadecimal | 0x3B8498 |
Divisor Catalog (5 of 16)
Collatz Trajectory (154 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.