2,913,664
27 × 13 × 17 × 103
Abundant
Even
Composite
2,913,664 factors as 2^7 × 13 × 17 × 103. Its 64 positive divisors give a proper-divisor sum of 3,769,376, so this integer is abundant. The Collatz stopping time is 213 steps.
Prime Factor Structure
Factorization String
2^7 × 13 × 17 × 103
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
6,683,040
Proper Divisor Sum
3,769,376
Digit Sum / Digital Root
31 (Root: 4)
Radix Representation
| Decimal | 2913664 |
| Binary | 1011000111010110000000 (22 bits) |
| Octal | 0o13072600 |
| Hexadecimal | 0x2C7580 |
Divisor Catalog (60 of 64)
Collatz Trajectory (213 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.