4,474,932
22 × 3 × 7 × 11 × 29 × 167
Abundant
Even
Composite
4,474,932 factors as 2^2 × 3 × 7 × 11 × 29 × 167. Its 96 positive divisors give a proper-divisor sum of 9,072,588, so this integer is abundant. The Collatz stopping time is 61 steps.
Resources
Prime Factor Structure
Factorization String
2^2 × 3 × 7 × 11 × 29 × 167
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
96
Divisor Sum (σ)
13,547,520
Proper Divisor Sum
9,072,588
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#4474931 ← → #4474933
Radix Representation
| Decimal | 4474932 |
| Binary | 10001000100100000110100 (23 bits) |
| Octal | 0o21044064 |
| Hexadecimal | 0x444834 |
Divisor Catalog (5 of 96)
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.