9,035,010
2 × 33 × 5 × 109 × 307
Abundant
Even
Composite
9,035,010 factors as 2 × 3^3 × 5 × 109 × 307. Its 64 positive divisors give a proper-divisor sum of 15,358,590, so this integer is abundant. The Collatz stopping time is 119 steps.
Prime Factor Structure
Factorization String
2 × 3^3 × 5 × 109 × 307
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
24,393,600
Proper Divisor Sum
15,358,590
Digit Sum / Digital Root
18 (Root: 9)
Radix Representation
| Decimal | 9035010 |
| Binary | 100010011101110100000010 (24 bits) |
| Octal | 0o42356402 |
| Hexadecimal | 0x89DD02 |
Divisor Catalog (60 of 64)
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.