9,107,776

2⁶ × 101 × 1409

9,107,776 factors as 2^6 × 101 × 1409. Its 28 positive divisors give a proper-divisor sum of 9,157,364, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2^6 × 101 × 1409

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 18,265,140

Proper Divisor Sum 9,157,364

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #9107773 ← → #9107797

Radix Representation

Decimal	9107776
Binary	100010101111100101000000 (24 bits)
Octal	0o42574500
Hexadecimal	0x8AF940

Divisor Catalog (28)

Collatz Trajectory (132 steps to reach 1)

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

9,107,776 4,553,888 2,276,944 1,138,472 569,236 284,618 142,309 426,928 213,464 106,732 53,366 26,683 80,050 40,025 120,076 60,038 30,019 90,058 45,029 135,088 67,544 33,772 16,886 8,443 25,330 12,665 37,996 18,998 9,499 28,498 14,249 42,748 21,374 10,687 32,062 16,031 48,094 24,047 72,142 36,071 108,214 54,107 162,322 81,161 243,484 121,742 60,871 182,614 91,307 273,922 136,961 410,884 205,442 102,721 308,164 154,082 77,041 231,124 115,562 57,781

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,107,775 Browse Full Index Next Integer #9,107,777 →