1,369,290
2 × 3 × 5 × 13 × 3511
Abundant
Even
Composite
1,369,290 factors as 2 × 3 × 5 × 13 × 3511. Its 32 positive divisors give a proper-divisor sum of 2,170,806, so this integer is abundant. The Collatz stopping time is 62 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 13 × 3511
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
3,540,096
Proper Divisor Sum
2,170,806
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#1369243 ← → #1369297
Radix Representation
| Decimal | 1369290 |
| Binary | 101001110010011001010 (21 bits) |
| Octal | 0o5162312 |
| Hexadecimal | 0x14E4CA |
Divisor Catalog (5 of 32)
Collatz Trajectory (62 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.