9,658,770

2 × 3 × 5 × 11 × 29269

9,658,770 factors as 2 × 3 × 5 × 11 × 29269. Its 32 positive divisors give a proper-divisor sum of 15,630,510, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 11 × 29269

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 25,289,280

Proper Divisor Sum 15,630,510

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9658751 ← → #9658837

Radix Representation

Decimal	9658770
Binary	100100110110000110010010 (24 bits)
Octal	0o44660622
Hexadecimal	0x936192

Divisor Catalog (32)

1 2 3 5 6 10 11 15 22 30 33 55 66 110 165 330 29,269 58,538 87,807 146,345 175,614 292,690 321,959 439,035 643,918 878,070 965,877 1,609,795 1,931,754 3,219,590 4,829,385 9,658,770

Collatz Trajectory (163 steps to reach 1)

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

9,658,770 4,829,385 14,488,156 7,244,078 3,622,039 10,866,118 5,433,059 16,299,178 8,149,589 24,448,768 12,224,384 6,112,192 3,056,096 1,528,048 764,024 382,012 191,006 95,503 286,510 143,255 429,766 214,883 644,650 322,325 966,976 483,488 241,744 120,872 60,436 30,218 15,109 45,328 22,664 11,332 5,666 2,833 8,500 4,250 2,125 6,376 3,188 1,594 797 2,392 1,196 598 299 898 449 1,348 674 337 1,012 506 253 760 380 190 95 286

← Previous Integer #9,658,769 Browse Full Index Next Integer #9,658,771 →