9,491,670

2 × 3² × 5 × 263 × 401

9,491,670 factors as 2 × 3^2 × 5 × 263 × 401. Its 48 positive divisors give a proper-divisor sum of 15,342,282, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 263 × 401

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 24,833,952

Proper Divisor Sum 15,342,282

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9491633 ← → #9491681

Radix Representation

Decimal	9491670
Binary	100100001101010011010110 (24 bits)
Octal	0o44152326
Hexadecimal	0x90D4D6

Divisor Catalog (48)

1 2 3 5 6 9 10 15 18 30 45 90 263 401 526 789 802 1,203 1,315 1,578 2,005 2,367 2,406 2,630 3,609 3,945 4,010 4,734 6,015 7,218 7,890 11,835 12,030 18,045 23,670 36,090 105,463 210,926 316,389 527,315 632,778 949,167 1,054,630 1,581,945 1,898,334 3,163,890 4,745,835 9,491,670

Collatz Trajectory (176 steps to reach 1)

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

9,491,670 4,745,835 14,237,506 7,118,753 21,356,260 10,678,130 5,339,065 16,017,196 8,008,598 4,004,299 12,012,898 6,006,449 18,019,348 9,009,674 4,504,837 13,514,512 6,757,256 3,378,628 1,689,314 844,657 2,533,972 1,266,986 633,493 1,900,480 950,240 475,120 237,560 118,780 59,390 29,695 89,086 44,543 133,630 66,815 200,446 100,223 300,670 150,335 451,006 225,503 676,510 338,255 1,014,766 507,383 1,522,150 761,075 2,283,226 1,141,613 3,424,840 1,712,420 856,210 428,105 1,284,316 642,158 321,079 963,238 481,619 1,444,858 722,429 2,167,288

← Previous Integer #9,491,669 Browse Full Index Next Integer #9,491,671 →