3,915,366
2 × 3 × 7 × 13 × 71 × 101
Abundant
Even
Composite
3,915,366 factors as 2 × 3 × 7 × 13 × 71 × 101. Its 64 positive divisors give a proper-divisor sum of 5,954,970, so this integer is abundant. The Collatz stopping time is 185 steps.
Prime Factor Structure
Factorization String
2 × 3 × 7 × 13 × 71 × 101
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
9,870,336
Proper Divisor Sum
5,954,970
Digit Sum / Digital Root
33 (Root: 6)
Radix Representation
| Decimal | 3915366 |
| Binary | 1110111011111001100110 (22 bits) |
| Octal | 0o16737146 |
| Hexadecimal | 0x3BBE66 |
Divisor Catalog (60 of 64)
Collatz Trajectory (185 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.