4,495,974
2 × 3 × 7 × 167 × 641
Abundant
Even
Composite
4,495,974 factors as 2 × 3 × 7 × 167 × 641. Its 32 positive divisors give a proper-divisor sum of 5,858,202, so this integer is abundant. The Collatz stopping time is 110 steps.
Prime Factor Structure
Factorization String
2 × 3 × 7 × 167 × 641
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
10,354,176
Proper Divisor Sum
5,858,202
Digit Sum / Digital Root
42 (Root: 6)
Radix Representation
| Decimal | 4495974 |
| Binary | 10001001001101001100110 (23 bits) |
| Octal | 0o21115146 |
| Hexadecimal | 0x449A66 |
Divisor Catalog (32)
Collatz Trajectory (110 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.