9,797,466

2 × 3 × 7 × 479 × 487

9,797,466 factors as 2 × 3 × 7 × 479 × 487. Its 32 positive divisors give a proper-divisor sum of 12,689,574, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 479 × 487

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 22,487,040

Proper Divisor Sum 12,689,574

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #9797461 ← → #9797467

Radix Representation

Decimal	9797466
Binary	100101010111111101011010 (24 bits)
Octal	0o45277532
Hexadecimal	0x957F5A

Divisor Catalog (32)

1 2 3 6 7 14 21 42 479 487 958 974 1,437 1,461 2,874 2,922 3,353 3,409 6,706 6,818 10,059 10,227 20,118 20,454 233,273 466,546 699,819 1,399,638 1,632,911 3,265,822 4,898,733 9,797,466

Collatz Trajectory (101 steps to reach 1)

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

9,797,466 4,898,733 14,696,200 7,348,100 3,674,050 1,837,025 5,511,076 2,755,538 1,377,769 4,133,308 2,066,654 1,033,327 3,099,982 1,549,991 4,649,974 2,324,987 6,974,962 3,487,481 10,462,444 5,231,222 2,615,611 7,846,834 3,923,417 11,770,252 5,885,126 2,942,563 8,827,690 4,413,845 13,241,536 6,620,768 3,310,384 1,655,192 827,596 413,798 206,899 620,698 310,349 931,048 465,524 232,762 116,381 349,144 174,572 87,286 43,643 130,930 65,465 196,396 98,198 49,099 147,298 73,649 220,948 110,474 55,237 165,712 82,856 41,428 20,714 10,357

← Previous Integer #9,797,465 Browse Full Index Next Integer #9,797,467 →