3,767,274
2 × 32 × 7 × 29 × 1031
Abundant
Even
Composite
3,767,274 factors as 2 × 3^2 × 7 × 29 × 1031. Its 48 positive divisors give a proper-divisor sum of 5,892,246, so this integer is abundant. The Collatz stopping time is 110 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^2 × 7 × 29 × 1031
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
9,659,520
Proper Divisor Sum
5,892,246
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#3767261 ← → #3767297
Radix Representation
| Decimal | 3767274 |
| Binary | 1110010111101111101010 (22 bits) |
| Octal | 0o16275752 |
| Hexadecimal | 0x397BEA |
Divisor Catalog (5 of 48)
Collatz Trajectory (110 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.