3,397,290
2 × 3 × 5 × 13 × 31 × 281
Abundant
Even
Composite
3,397,290 factors as 2 × 3 × 5 × 13 × 31 × 281. Its 64 positive divisors give a proper-divisor sum of 5,698,902, so this integer is abundant. The Collatz stopping time is 84 steps.
Prime Factor Structure
Factorization String
2 × 3 × 5 × 13 × 31 × 281
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
9,096,192
Proper Divisor Sum
5,698,902
Digit Sum / Digital Root
33 (Root: 6)
Radix Representation
| Decimal | 3397290 |
| Binary | 1100111101011010101010 (22 bits) |
| Octal | 0o14753252 |
| Hexadecimal | 0x33D6AA |
Divisor Catalog (60 of 64)
Collatz Trajectory (84 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.