1,832,796
22 × 32 × 72 × 1039
Abundant
Even
Composite
1,832,796 factors as 2^2 × 3^2 × 7^2 × 1039. Its 54 positive divisors give a proper-divisor sum of 3,561,684, so this integer is abundant. The Collatz stopping time is 109 steps.
Prime Factor Structure
Factorization String
2^2 × 3^2 × 7^2 × 1039
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
54
Divisor Sum (σ)
5,394,480
Proper Divisor Sum
3,561,684
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#1832791 ← → #1832819
Radix Representation
| Decimal | 1832796 |
| Binary | 110111111011101011100 (21 bits) |
| Octal | 0o6773534 |
| Hexadecimal | 0x1BF75C |
Divisor Catalog (54)
Collatz Trajectory (109 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):