3,472,620
22 × 3 × 5 × 31 × 1867
Abundant
Even
Composite
3,472,620 factors as 2^2 × 3 × 5 × 31 × 1867. Its 48 positive divisors give a proper-divisor sum of 6,569,748, so this integer is abundant. The Collatz stopping time is 128 steps.
Resources
Prime Factor Structure
Factorization String
2^2 × 3 × 5 × 31 × 1867
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
10,042,368
Proper Divisor Sum
6,569,748
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#3472619 ← → #3472627
Radix Representation
| Decimal | 3472620 |
| Binary | 1101001111110011101100 (22 bits) |
| Octal | 0o15176354 |
| Hexadecimal | 0x34FCEC |
Divisor Catalog (5 of 48)
Collatz Trajectory (128 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.