9,569,928

2³ × 3 × 283 × 1409

9,569,928 factors as 2^3 × 3 × 283 × 1409. Its 32 positive divisors give a proper-divisor sum of 14,456,472, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 283 × 1409

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 24,026,400

Proper Divisor Sum 14,456,472

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #9569921 ← → #9569947

Radix Representation

Decimal	9569928
Binary	100100100000011010001000 (24 bits)
Octal	0o44403210
Hexadecimal	0x920688

Divisor Catalog (32)

1 2 3 4 6 8 12 24 283 566 849 1,132 1,409 1,698 2,264 2,818 3,396 4,227 5,636 6,792 8,454 11,272 16,908 33,816 398,747 797,494 1,196,241 1,594,988 2,392,482 3,189,976 4,784,964 9,569,928

Collatz Trajectory (101 steps to reach 1)

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

9,569,928 4,784,964 2,392,482 1,196,241 3,588,724 1,794,362 897,181 2,691,544 1,345,772 672,886 336,443 1,009,330 504,665 1,513,996 756,998 378,499 1,135,498 567,749 1,703,248 851,624 425,812 212,906 106,453 319,360 159,680 79,840 39,920 19,960 9,980 4,990 2,495 7,486 3,743 11,230 5,615 16,846 8,423 25,270 12,635 37,906 18,953 56,860 28,430 14,215 42,646 21,323 63,970 31,985 95,956 47,978 23,989 71,968 35,984 17,992 8,996 4,498 2,249 6,748 3,374 1,687

← Previous Integer #9,569,927 Browse Full Index Next Integer #9,569,929 →