9,491,574

2 × 3 × 1581929

9,491,574 factors as 2 × 3 × 1581929. Its 8 positive divisors give a proper-divisor sum of 9,491,586, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1581929

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 18,983,160

Proper Divisor Sum 9,491,586

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9491569 ← → #9491579

Radix Representation

Decimal	9491574
Binary	100100001101010001110110 (24 bits)
Octal	0o44152166
Hexadecimal	0x90D476

Divisor Catalog (8)

1 2 3 6 1,581,929 3,163,858 4,745,787 9,491,574

Collatz Trajectory (176 steps to reach 1)

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

9,491,574 4,745,787 14,237,362 7,118,681 21,356,044 10,678,022 5,339,011 16,017,034 8,008,517 24,025,552 12,012,776 6,006,388 3,003,194 1,501,597 4,504,792 2,252,396 1,126,198 563,099 1,689,298 844,649 2,533,948 1,266,974 633,487 1,900,462 950,231 2,850,694 1,425,347 4,276,042 2,138,021 6,414,064 3,207,032 1,603,516 801,758 400,879 1,202,638 601,319 1,803,958 901,979 2,705,938 1,352,969 4,058,908 2,029,454 1,014,727 3,044,182 1,522,091 4,566,274 2,283,137 6,849,412 3,424,706 1,712,353 5,137,060 2,568,530 1,284,265 3,852,796 1,926,398 963,199 2,889,598 1,444,799 4,334,398 2,167,199

← Previous Integer #9,491,573 Browse Full Index Next Integer #9,491,575 →