9,700,368

2⁴ × 3 × 179 × 1129

9,700,368 factors as 2^4 × 3 × 179 × 1129. Its 40 positive divisors give a proper-divisor sum of 15,521,232, so this integer is abundant. The Collatz stopping time is 207 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 179 × 1129

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 25,221,600

Proper Divisor Sum 15,521,232

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9700357 ← → #9700381

Radix Representation

Decimal	9700368
Binary	100101000000010000010000 (24 bits)
Octal	0o45002020
Hexadecimal	0x940410

Divisor Catalog (40)

1 2 3 4 6 8 12 16 24 48 179 358 537 716 1,074 1,129 1,432 2,148 2,258 2,864 3,387 4,296 4,516 6,774 8,592 9,032 13,548 18,064 27,096 54,192 202,091 404,182 606,273 808,364 1,212,546 1,616,728 2,425,092 3,233,456 4,850,184 9,700,368

Collatz Trajectory (207 steps to reach 1)

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

9,700,368 4,850,184 2,425,092 1,212,546 606,273 1,818,820 909,410 454,705 1,364,116 682,058 341,029 1,023,088 511,544 255,772 127,886 63,943 191,830 95,915 287,746 143,873 431,620 215,810 107,905 323,716 161,858 80,929 242,788 121,394 60,697 182,092 91,046 45,523 136,570 68,285 204,856 102,428 51,214 25,607 76,822 38,411 115,234 57,617 172,852 86,426 43,213 129,640 64,820 32,410 16,205 48,616 24,308 12,154 6,077 18,232 9,116 4,558 2,279 6,838 3,419 10,258

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