9,702,930
2 × 3 × 5 × 281 × 1151
Abundant
Even
Composite
9,702,930 factors as 2 × 3 × 5 × 281 × 1151. Its 32 positive divisors give a proper-divisor sum of 13,687,278, so this integer is abundant. The Collatz stopping time is 119 steps.
Prime Factor Structure
Factorization String
2 × 3 × 5 × 281 × 1151
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
23,390,208
Proper Divisor Sum
13,687,278
Digit Sum / Digital Root
30 (Root: 3)
Radix Representation
| Decimal | 9702930 |
| Binary | 100101000000111000010010 (24 bits) |
| Octal | 0o45007022 |
| Hexadecimal | 0x940E12 |
Divisor Catalog (32)
Collatz Trajectory (119 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.