9,292,774

2 × 401 × 11587

9,292,774 factors as 2 × 401 × 11587. Its 8 positive divisors give a proper-divisor sum of 4,682,354, so this integer is deficient. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2 × 401 × 11587

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,975,128

Proper Divisor Sum 4,682,354

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #9292771 ← → #9292783

Radix Representation

Decimal	9292774
Binary	100011011100101111100110 (24 bits)
Octal	0o43345746
Hexadecimal	0x8DCBE6

Divisor Catalog (8)

1 2 401 802 11,587 23,174 4,646,387 9,292,774

Collatz Trajectory (194 steps to reach 1)

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

9,292,774 4,646,387 13,939,162 6,969,581 20,908,744 10,454,372 5,227,186 2,613,593 7,840,780 3,920,390 1,960,195 5,880,586 2,940,293 8,820,880 4,410,440 2,205,220 1,102,610 551,305 1,653,916 826,958 413,479 1,240,438 620,219 1,860,658 930,329 2,790,988 1,395,494 697,747 2,093,242 1,046,621 3,139,864 1,569,932 784,966 392,483 1,177,450 588,725 1,766,176 883,088 441,544 220,772 110,386 55,193 165,580 82,790 41,395 124,186 62,093 186,280 93,140 46,570 23,285 69,856 34,928 17,464 8,732 4,366 2,183 6,550 3,275 9,826

← Previous Integer #9,292,773 Browse Full Index Next Integer #9,292,775 →