7,689,588

2² × 3 × 59 × 10861

7,689,588 factors as 2^2 × 3 × 59 × 10861. Its 24 positive divisors give a proper-divisor sum of 10,558,572, so this integer is abundant. The Collatz stopping time is 72 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 59 × 10861

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 18,248,160

Proper Divisor Sum 10,558,572

Digit Sum / Digital Root 51 (Root: 6)

Adjacent Primes #7689571 ← → #7689607

Radix Representation

Decimal	7689588
Binary	11101010101010101110100 (23 bits)
Octal	0o35252564
Hexadecimal	0x755574

Divisor Catalog (24)

1 2 3 4 6 12 59 118 177 236 354 708 10,861 21,722 32,583 43,444 65,166 130,332 640,799 1,281,598 1,922,397 2,563,196 3,844,794 7,689,588

Collatz Trajectory (72 steps to reach 1)

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

7,689,588 3,844,794 1,922,397 5,767,192 2,883,596 1,441,798 720,899 2,162,698 1,081,349 3,244,048 1,622,024 811,012 405,506 202,753 608,260 304,130 152,065 456,196 228,098 114,049 342,148 171,074 85,537 256,612 128,306 64,153 192,460 96,230 48,115 144,346 72,173 216,520 108,260 54,130 27,065 81,196 40,598 20,299 60,898 30,449 91,348 45,674 22,837 68,512 34,256 17,128 8,564 4,282 2,141 6,424 3,212 1,606 803 2,410 1,205 3,616 1,808 904 452 226

← Previous Integer #7,689,587 Browse Full Index Next Integer #7,689,589 →