9,273,288

2³ × 3 × 47 × 8221

9,273,288 factors as 2^3 × 3 × 47 × 8221. Its 32 positive divisors give a proper-divisor sum of 14,406,072, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 47 × 8221

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 23,679,360

Proper Divisor Sum 14,406,072

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9273287 ← → #9273289

Radix Representation

Decimal	9273288
Binary	100011010111111111001000 (24 bits)
Octal	0o43277710
Hexadecimal	0x8D7FC8

Divisor Catalog (32)

1 2 3 4 6 8 12 24 47 94 141 188 282 376 564 1,128 8,221 16,442 24,663 32,884 49,326 65,768 98,652 197,304 386,387 772,774 1,159,161 1,545,548 2,318,322 3,091,096 4,636,644 9,273,288

Collatz Trajectory (101 steps to reach 1)

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

9,273,288 4,636,644 2,318,322 1,159,161 3,477,484 1,738,742 869,371 2,608,114 1,304,057 3,912,172 1,956,086 978,043 2,934,130 1,467,065 4,401,196 2,200,598 1,100,299 3,300,898 1,650,449 4,951,348 2,475,674 1,237,837 3,713,512 1,856,756 928,378 464,189 1,392,568 696,284 348,142 174,071 522,214 261,107 783,322 391,661 1,174,984 587,492 293,746 146,873 440,620 220,310 110,155 330,466 165,233 495,700 247,850 123,925 371,776 185,888 92,944 46,472 23,236 11,618 5,809 17,428 8,714 4,357 13,072 6,536 3,268 1,634

← Previous Integer #9,273,287 Browse Full Index Next Integer #9,273,289 →