9,545,280

2⁶ × 3 × 5 × 61 × 163

9,545,280 factors as 2^6 × 3 × 5 × 61 × 163. Its 112 positive divisors give a proper-divisor sum of 21,446,784, so this integer is abundant. The Collatz stopping time is 119 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 5 × 61 × 163

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 112

Divisor Sum (σ) 30,992,064

Proper Divisor Sum 21,446,784

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9545233 ← → #9545317

Radix Representation

Decimal	9545280
Binary	100100011010011001000000 (24 bits)
Octal	0o44323100
Hexadecimal	0x91A640

Divisor Catalog (60 of 112)

1 2 3 4 5 6 8 10 12 15 16 20 24 30 32 40 48 60 61 64 80 96 120 122 160 163 183 192 240 244 305 320 326 366 480 488 489 610 652 732 815 915 960 976 978 1,220 1,304 1,464 1,630 1,830 1,952 1,956 2,440 2,445 2,608 2,928 3,260 3,660 3,904 3,912

Collatz Trajectory (119 steps to reach 1)

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

9,545,280 4,772,640 2,386,320 1,193,160 596,580 298,290 149,145 447,436 223,718 111,859 335,578 167,789 503,368 251,684 125,842 62,921 188,764 94,382 47,191 141,574 70,787 212,362 106,181 318,544 159,272 79,636 39,818 19,909 59,728 29,864 14,932 7,466 3,733 11,200 5,600 2,800 1,400 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502 251 754 377 1,132 566 283

← Previous Integer #9,545,279 Browse Full Index Next Integer #9,545,281 →