9,706,340

2² × 5 × 7 × 19 × 41 × 89

9,706,340 factors as 2^2 × 5 × 7 × 19 × 41 × 89. Its 96 positive divisors give a proper-divisor sum of 15,695,260, so this integer is abundant. The Collatz stopping time is 238 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 7 × 19 × 41 × 89

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 25,401,600

Proper Divisor Sum 15,695,260

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #9706309 ← → #9706349

Radix Representation

Decimal	9706340
Binary	100101000001101101100100 (24 bits)
Octal	0o45015544
Hexadecimal	0x941B64

Divisor Catalog (60 of 96)

1 2 4 5 7 10 14 19 20 28 35 38 41 70 76 82 89 95 133 140 164 178 190 205 266 287 356 380 410 445 532 574 623 665 779 820 890 1,148 1,246 1,330 1,435 1,558 1,691 1,780 2,492 2,660 2,870 3,115 3,116 3,382 3,649 3,895 5,453 5,740 6,230 6,764 7,298 7,790 8,455 10,906

Collatz Trajectory (238 steps to reach 1)

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

9,706,340 4,853,170 2,426,585 7,279,756 3,639,878 1,819,939 5,459,818 2,729,909 8,189,728 4,094,864 2,047,432 1,023,716 511,858 255,929 767,788 383,894 191,947 575,842 287,921 863,764 431,882 215,941 647,824 323,912 161,956 80,978 40,489 121,468 60,734 30,367 91,102 45,551 136,654 68,327 204,982 102,491 307,474 153,737 461,212 230,606 115,303 345,910 172,955 518,866 259,433 778,300 389,150 194,575 583,726 291,863 875,590 437,795 1,313,386 656,693 1,970,080 985,040 492,520 246,260 123,130 61,565

← Previous Integer #9,706,339 Browse Full Index Next Integer #9,706,341 →