9,288,804

2² × 3 × 7 × 110581

9,288,804 factors as 2^2 × 3 × 7 × 110581. Its 24 positive divisors give a proper-divisor sum of 15,481,564, so this integer is abundant. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 110581

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 24,770,368

Proper Divisor Sum 15,481,564

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9288793 ← → #9288821

Radix Representation

Decimal	9288804
Binary	100011011011110001100100 (24 bits)
Octal	0o43336144
Hexadecimal	0x8DBC64

Divisor Catalog (24)

1 2 3 4 6 7 12 14 21 28 42 84 110,581 221,162 331,743 442,324 663,486 774,067 1,326,972 1,548,134 2,322,201 3,096,268 4,644,402 9,288,804

Collatz Trajectory (194 steps to reach 1)

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

9,288,804 4,644,402 2,322,201 6,966,604 3,483,302 1,741,651 5,224,954 2,612,477 7,837,432 3,918,716 1,959,358 979,679 2,939,038 1,469,519 4,408,558 2,204,279 6,612,838 3,306,419 9,919,258 4,959,629 14,878,888 7,439,444 3,719,722 1,859,861 5,579,584 2,789,792 1,394,896 697,448 348,724 174,362 87,181 261,544 130,772 65,386 32,693 98,080 49,040 24,520 12,260 6,130 3,065 9,196 4,598 2,299 6,898 3,449 10,348 5,174 2,587 7,762 3,881 11,644 5,822 2,911 8,734 4,367 13,102 6,551 19,654 9,827

← Previous Integer #9,288,803 Browse Full Index Next Integer #9,288,805 →