41,500,536
23 × 3 × 7 × 11 × 17 × 1321
Abundant
Even
Composite
41,500,536 factors as 2^3 × 3 × 7 × 11 × 17 × 1321. Its 128 positive divisors give a proper-divisor sum of 95,564,424, so this integer is abundant. The Collatz stopping time is 222 steps.
Prime Factor Structure
Factorization String
2^3 × 3 × 7 × 11 × 17 × 1321
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
128
Divisor Sum (σ)
137,064,960
Proper Divisor Sum
95,564,424
Digit Sum / Digital Root
24 (Root: 6)
Radix Representation
| Decimal | 41500536 |
| Binary | 10011110010011111101111000 (26 bits) |
| Octal | 0o236237570 |
| Hexadecimal | 0x2793F78 |
Divisor Catalog (60 of 128)
Collatz Trajectory (222 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.