809,658

2 × 3² × 31 × 1451

809,658 factors as 2 × 3^2 × 31 × 1451. Its 24 positive divisors give a proper-divisor sum of 1,002,438, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 31 × 1451

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 1,812,096

Proper Divisor Sum 1,002,438

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #809629 ← → #809701

Radix Representation

Decimal	809658
Binary	11000101101010111010 (20 bits)
Octal	0o3055272
Hexadecimal	0xC5ABA

Divisor Catalog (24)

Collatz Trajectory (61 steps to reach 1)

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

809,658 404,829 1,214,488 607,244 303,622 151,811 455,434 227,717 683,152 341,576 170,788 85,394 42,697 128,092 64,046 32,023 96,070 48,035 144,106 72,053 216,160 108,080 54,040 27,020 13,510 6,755 20,266 10,133 30,400 15,200 7,600 3,800 1,900 950 475 1,426 713 2,140 1,070 535 1,606 803 2,410 1,205 3,616 1,808 904 452 226 113 340 170 85 256 128 64 32 16 8 4

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #809,657 Browse Full Index Next Integer #809,659 →