4,659,130
2 × 5 × 7 × 101 × 659
Abundant
Even
Composite
4,659,130 factors as 2 × 5 × 7 × 101 × 659. Its 32 positive divisors give a proper-divisor sum of 5,034,950, so this integer is abundant. The Collatz stopping time is 149 steps.
Prime Factor Structure
Factorization String
2 × 5 × 7 × 101 × 659
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
9,694,080
Proper Divisor Sum
5,034,950
Digit Sum / Digital Root
28 (Root: 1)
Radix Representation
| Decimal | 4659130 |
| Binary | 10001110001011110111010 (23 bits) |
| Octal | 0o21613672 |
| Hexadecimal | 0x4717BA |
Divisor Catalog (32)
Collatz Trajectory (149 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.