7,132,368
24 × 3 × 139 × 1069
Abundant
Even
Composite
7,132,368 factors as 2^4 × 3 × 139 × 1069. Its 40 positive divisors give a proper-divisor sum of 11,442,832, so this integer is abundant. The Collatz stopping time is 266 steps.
Prime Factor Structure
Factorization String
2^4 × 3 × 139 × 1069
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
18,575,200
Proper Divisor Sum
11,442,832
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#7132337 ← → #7132373
Radix Representation
| Decimal | 7132368 |
| Binary | 11011001101010011010000 (23 bits) |
| Octal | 0o33152320 |
| Hexadecimal | 0x6CD4D0 |
Divisor Catalog (40)
Collatz Trajectory (266 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):