4,641,792
210 × 3 × 1511
Abundant
Even
Composite
4,641,792 factors as 2^10 × 3 × 1511. Its 44 positive divisors give a proper-divisor sum of 7,738,464, so this integer is abundant. The Collatz stopping time is 74 steps.
Resources
Prime Factor Structure
Factorization String
2^10 × 3 × 1511
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
44
Divisor Sum (σ)
12,380,256
Proper Divisor Sum
7,738,464
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#4641787 ← → #4641811
Radix Representation
| Decimal | 4641792 |
| Binary | 10001101101010000000000 (23 bits) |
| Octal | 0o21552000 |
| Hexadecimal | 0x46D400 |
Divisor Catalog (5 of 44)
Collatz Trajectory (74 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.