10,004,406
2 × 3 × 1667401
Abundant
Even
Composite
10,004,406 factors as 2 × 3 × 1667401. Its 8 positive divisors give a proper-divisor sum of 10,004,418, so this integer is abundant. The Collatz stopping time is 114 steps.
Prime Factor Structure
Factorization String
2 × 3 × 1667401
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
20,008,824
Proper Divisor Sum
10,004,418
Digit Sum / Digital Root
15 (Root: 6)
Radix Representation
| Decimal | 10004406 |
| Binary | 100110001010011110110110 (24 bits) |
| Octal | 0o46123666 |
| Hexadecimal | 0x98A7B6 |
Divisor Catalog (8)
Collatz Trajectory (114 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.