9,578,560

2⁶ × 5 × 37 × 809

9,578,560 factors as 2^6 × 5 × 37 × 809. Its 56 positive divisors give a proper-divisor sum of 13,875,800, so this integer is abundant. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2^6 × 5 × 37 × 809

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 56

Divisor Sum (σ) 23,454,360

Proper Divisor Sum 13,875,800

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #9578507 ← → #9578561

Radix Representation

Decimal	9578560
Binary	100100100010100001000000 (24 bits)
Octal	0o44424100
Hexadecimal	0x922840

Divisor Catalog (56)

1 2 4 5 8 10 16 20 32 37 40 64 74 80 148 160 185 296 320 370 592 740 809 1,184 1,480 1,618 2,368 2,960 3,236 4,045 5,920 6,472 8,090 11,840 12,944 16,180 25,888 29,933 32,360 51,776 59,866 64,720 119,732 129,440 149,665 239,464 258,880 299,330 478,928 598,660 957,856 1,197,320 1,915,712 2,394,640 4,789,280 9,578,560

Collatz Trajectory (194 steps to reach 1)

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

9,578,560 4,789,280 2,394,640 1,197,320 598,660 299,330 149,665 448,996 224,498 112,249 336,748 168,374 84,187 252,562 126,281 378,844 189,422 94,711 284,134 142,067 426,202 213,101 639,304 319,652 159,826 79,913 239,740 119,870 59,935 179,806 89,903 269,710 134,855 404,566 202,283 606,850 303,425 910,276 455,138 227,569 682,708 341,354 170,677 512,032 256,016 128,008 64,004 32,002 16,001 48,004 24,002 12,001 36,004 18,002 9,001 27,004 13,502 6,751 20,254 10,127

← Previous Integer #9,578,559 Browse Full Index Next Integer #9,578,561 →