811,098

2 × 3² × 45061

811,098 factors as 2 × 3^2 × 45061. Its 12 positive divisors give a proper-divisor sum of 946,320, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 45061

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,757,418

Proper Divisor Sum 946,320

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #811081 ← → #811099

Radix Representation

Decimal	811098
Binary	11000110000001011010 (20 bits)
Octal	0o3060132
Hexadecimal	0xC605A

Divisor Catalog (12)

1 2 3 6 9 18 45,061 90,122 135,183 270,366 405,549 811,098

Collatz Trajectory (131 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

811,098 405,549 1,216,648 608,324 304,162 152,081 456,244 228,122 114,061 342,184 171,092 85,546 42,773 128,320 64,160 32,080 16,040 8,020 4,010 2,005 6,016 3,008 1,504 752 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890

← Previous Integer #811,097 Browse Full Index Next Integer #811,099 →