9,655,368

2³ × 3 × 402307

9,655,368 factors as 2^3 × 3 × 402307. Its 16 positive divisors give a proper-divisor sum of 14,483,112, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 402307

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 24,138,480

Proper Divisor Sum 14,483,112

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9655367 ← → #9655391

Radix Representation

Decimal	9655368
Binary	100100110101010001001000 (24 bits)
Octal	0o44652110
Hexadecimal	0x935448

Divisor Catalog (16)

1 2 3 4 6 8 12 24 402,307 804,614 1,206,921 1,609,228 2,413,842 3,218,456 4,827,684 9,655,368

Collatz Trajectory (145 steps to reach 1)

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

9,655,368 4,827,684 2,413,842 1,206,921 3,620,764 1,810,382 905,191 2,715,574 1,357,787 4,073,362 2,036,681 6,110,044 3,055,022 1,527,511 4,582,534 2,291,267 6,873,802 3,436,901 10,310,704 5,155,352 2,577,676 1,288,838 644,419 1,933,258 966,629 2,899,888 1,449,944 724,972 362,486 181,243 543,730 271,865 815,596 407,798 203,899 611,698 305,849 917,548 458,774 229,387 688,162 344,081 1,032,244 516,122 258,061 774,184 387,092 193,546 96,773 290,320 145,160 72,580 36,290 18,145 54,436 27,218 13,609 40,828 20,414 10,207

← Previous Integer #9,655,367 Browse Full Index Next Integer #9,655,369 →