14,799,642
2 × 3 × 11 × 13 × 47 × 367
Abundant
Even
Composite
14,799,642 factors as 2 × 3 × 11 × 13 × 47 × 367. Its 64 positive divisors give a proper-divisor sum of 20,810,982, so this integer is abundant. The Collatz stopping time is 143 steps.
Prime Factor Structure
Factorization String
2 × 3 × 11 × 13 × 47 × 367
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
35,610,624
Proper Divisor Sum
20,810,982
Digit Sum / Digital Root
42 (Root: 6)
Radix Representation
| Decimal | 14799642 |
| Binary | 111000011101001100011010 (24 bits) |
| Octal | 0o70351432 |
| Hexadecimal | 0xE1D31A |
Divisor Catalog (60 of 64)
Collatz Trajectory (143 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.