9,463,914
2 × 32 × 525773
Abundant
Even
Composite
9,463,914 factors as 2 × 3^2 × 525773. Its 12 positive divisors give a proper-divisor sum of 11,041,272, so this integer is abundant. The Collatz stopping time is 101 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^2 × 525773
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
12
Divisor Sum (σ)
20,505,186
Proper Divisor Sum
11,041,272
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#9463901 ← → #9463921
Radix Representation
| Decimal | 9463914 |
| Binary | 100100000110100001101010 (24 bits) |
| Octal | 0o44064152 |
| Hexadecimal | 0x90686A |
Divisor Catalog (5 of 12)
Collatz Trajectory (101 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.