5,848,686

2 × 3⁴ × 79 × 457

5,848,686 factors as 2 × 3^4 × 79 × 457. Its 40 positive divisors give a proper-divisor sum of 7,451,634, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 79 × 457

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 13,300,320

Proper Divisor Sum 7,451,634

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #5848681 ← → #5848699

Radix Representation

Decimal	5848686
Binary	10110010011111001101110 (23 bits)
Octal	0o26237156
Hexadecimal	0x593E6E

Divisor Catalog (40)

1 2 3 6 9 18 27 54 79 81 158 162 237 457 474 711 914 1,371 1,422 2,133 2,742 4,113 4,266 6,399 8,226 12,339 12,798 24,678 36,103 37,017 72,206 74,034 108,309 216,618 324,927 649,854 974,781 1,949,562 2,924,343 5,848,686

Collatz Trajectory (90 steps to reach 1)

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

5,848,686 2,924,343 8,773,030 4,386,515 13,159,546 6,579,773 19,739,320 9,869,660 4,934,830 2,467,415 7,402,246 3,701,123 11,103,370 5,551,685 16,655,056 8,327,528 4,163,764 2,081,882 1,040,941 3,122,824 1,561,412 780,706 390,353 1,171,060 585,530 292,765 878,296 439,148 219,574 109,787 329,362 164,681 494,044 247,022 123,511 370,534 185,267 555,802 277,901 833,704 416,852 208,426 104,213 312,640 156,320 78,160 39,080 19,540 9,770 4,885 14,656 7,328 3,664 1,832 916 458 229 688 344 172

← Previous Integer #5,848,685 Browse Full Index Next Integer #5,848,687 →