4,320,690
2 × 3 × 5 × 11 × 13093
Abundant
Even
Composite
4,320,690 factors as 2 × 3 × 5 × 11 × 13093. Its 32 positive divisors give a proper-divisor sum of 6,992,526, so this integer is abundant. The Collatz stopping time is 118 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 11 × 13093
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
11,313,216
Proper Divisor Sum
6,992,526
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#4320689 ← → #4320697
Radix Representation
| Decimal | 4320690 |
| Binary | 10000011110110110110010 (23 bits) |
| Octal | 0o20366662 |
| Hexadecimal | 0x41EDB2 |
Divisor Catalog (5 of 32)
Collatz Trajectory (118 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.