10,250,658
2 × 33 × 11 × 17257
Abundant
Even
Composite
10,250,658 factors as 2 × 3^3 × 11 × 17257. Its 32 positive divisors give a proper-divisor sum of 14,600,862, so this integer is abundant. The Collatz stopping time is 145 steps.
Prime Factor Structure
Factorization String
2 × 3^3 × 11 × 17257
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
24,851,520
Proper Divisor Sum
14,600,862
Digit Sum / Digital Root
27 (Root: 9)
Radix Representation
| Decimal | 10250658 |
| Binary | 100111000110100110100010 (24 bits) |
| Octal | 0o47064642 |
| Hexadecimal | 0x9C69A2 |
Divisor Catalog (32)
Collatz Trajectory (145 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.