41,006,406
2 × 3 × 7 × 29 × 131 × 257
Abundant
Even
Composite
41,006,406 factors as 2 × 3 × 7 × 29 × 131 × 257. Its 64 positive divisors give a proper-divisor sum of 57,074,874, so this integer is abundant. The Collatz stopping time is 253 steps.
Prime Factor Structure
Factorization String
2 × 3 × 7 × 29 × 131 × 257
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
98,081,280
Proper Divisor Sum
57,074,874
Digit Sum / Digital Root
21 (Root: 3)
Radix Representation
| Decimal | 41006406 |
| Binary | 10011100011011010101000110 (26 bits) |
| Octal | 0o234332506 |
| Hexadecimal | 0x271B546 |
Divisor Catalog (60 of 64)
Collatz Trajectory (253 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.