4,651,410
2 × 3 × 5 × 155047
Abundant
Even
Composite
4,651,410 factors as 2 × 3 × 5 × 155047. Its 16 positive divisors give a proper-divisor sum of 6,512,046, so this integer is abundant. The Collatz stopping time is 162 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 155047
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
11,163,456
Proper Divisor Sum
6,512,046
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#4651399 ← → #4651429
Radix Representation
| Decimal | 4651410 |
| Binary | 10001101111100110010010 (23 bits) |
| Octal | 0o21574622 |
| Hexadecimal | 0x46F992 |
Divisor Catalog (5 of 16)
Collatz Trajectory (162 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.