9,543,120

2⁴ × 3 × 5 × 17 × 2339

9,543,120 factors as 2^4 × 3 × 5 × 17 × 2339. Its 80 positive divisors give a proper-divisor sum of 21,794,160, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 5 × 17 × 2339

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 31,337,280

Proper Divisor Sum 21,794,160

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #9543113 ← → #9543143

Radix Representation

Decimal	9543120
Binary	100100011001110111010000 (24 bits)
Octal	0o44316720
Hexadecimal	0x919DD0

Divisor Catalog (60 of 80)

1 2 3 4 5 6 8 10 12 15 16 17 20 24 30 34 40 48 51 60 68 80 85 102 120 136 170 204 240 255 272 340 408 510 680 816 1,020 1,360 2,040 2,339 4,080 4,678 7,017 9,356 11,695 14,034 18,712 23,390 28,068 35,085 37,424 39,763 46,780 56,136 70,170 79,526 93,560 112,272 119,289 140,340

Collatz Trajectory (101 steps to reach 1)

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

9,543,120 4,771,560 2,385,780 1,192,890 596,445 1,789,336 894,668 447,334 223,667 671,002 335,501 1,006,504 503,252 251,626 125,813 377,440 188,720 94,360 47,180 23,590 11,795 35,386 17,693 53,080 26,540 13,270 6,635 19,906 9,953 29,860 14,930 7,465 22,396 11,198 5,599 16,798 8,399 25,198 12,599 37,798 18,899 56,698 28,349 85,048 42,524 21,262 10,631 31,894 15,947 47,842 23,921 71,764 35,882 17,941 53,824 26,912 13,456 6,728 3,364 1,682

← Previous Integer #9,543,119 Browse Full Index Next Integer #9,543,121 →