9,217,288

2³ × 1152161

9,217,288 factors as 2^3 × 1152161. Its 8 positive divisors give a proper-divisor sum of 8,065,142, so this integer is deficient. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 2^3 × 1152161

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 17,282,430

Proper Divisor Sum 8,065,142

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #9217277 ← → #9217303

Radix Representation

Decimal	9217288
Binary	100011001010010100001000 (24 bits)
Octal	0o43122410
Hexadecimal	0x8CA508

Divisor Catalog (8)

1 2 4 8 1,152,161 2,304,322 4,608,644 9,217,288

Collatz Trajectory (181 steps to reach 1)

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

9,217,288 4,608,644 2,304,322 1,152,161 3,456,484 1,728,242 864,121 2,592,364 1,296,182 648,091 1,944,274 972,137 2,916,412 1,458,206 729,103 2,187,310 1,093,655 3,280,966 1,640,483 4,921,450 2,460,725 7,382,176 3,691,088 1,845,544 922,772 461,386 230,693 692,080 346,040 173,020 86,510 43,255 129,766 64,883 194,650 97,325 291,976 145,988 72,994 36,497 109,492 54,746 27,373 82,120 41,060 20,530 10,265 30,796 15,398 7,699 23,098 11,549 34,648 17,324 8,662 4,331 12,994 6,497 19,492 9,746

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