669,126
2 × 3 × 111521
Abundant
Even
Composite
669,126 factors as 2 × 3 × 111521. Its 8 positive divisors give a proper-divisor sum of 669,138, so this integer is abundant. The Collatz stopping time is 61 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 111521
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
1,338,264
Proper Divisor Sum
669,138
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#669121 ← → #669127
Radix Representation
| Decimal | 669126 |
| Binary | 10100011010111000110 (20 bits) |
| Octal | 0o2432706 |
| Hexadecimal | 0xA35C6 |
Divisor Catalog (5 of 8)
Collatz Trajectory (61 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.