666,408
23 × 3 × 27767
Abundant
Even
Composite
666,408 factors as 2^3 × 3 × 27767. Its 16 positive divisors give a proper-divisor sum of 999,672, so this integer is abundant. The Collatz stopping time is 154 steps.
Prime Factor Structure
Factorization String
2^3 × 3 × 27767
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
1,666,080
Proper Divisor Sum
999,672
Digit Sum / Digital Root
30 (Root: 3)
Radix Representation
| Decimal | 666408 |
| Binary | 10100010101100101000 (20 bits) |
| Octal | 0o2425450 |
| Hexadecimal | 0xA2B28 |
Divisor Catalog (16)
Collatz Trajectory (154 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.
No other profiles in this collection.