9,560,892

2² × 3 × 11 × 72431

9,560,892 factors as 2^2 × 3 × 11 × 72431. Its 24 positive divisors give a proper-divisor sum of 14,776,260, so this integer is abundant. The Collatz stopping time is 230 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 11 × 72431

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 24,337,152

Proper Divisor Sum 14,776,260

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9560861 ← → #9560909

Radix Representation

Decimal	9560892
Binary	100100011110001100111100 (24 bits)
Octal	0o44361474
Hexadecimal	0x91E33C

Divisor Catalog (24)

1 2 3 4 6 11 12 22 33 44 66 132 72,431 144,862 217,293 289,724 434,586 796,741 869,172 1,593,482 2,390,223 3,186,964 4,780,446 9,560,892

Collatz Trajectory (230 steps to reach 1)

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

9,560,892 4,780,446 2,390,223 7,170,670 3,585,335 10,756,006 5,378,003 16,134,010 8,067,005 24,201,016 12,100,508 6,050,254 3,025,127 9,075,382 4,537,691 13,613,074 6,806,537 20,419,612 10,209,806 5,104,903 15,314,710 7,657,355 22,972,066 11,486,033 34,458,100 17,229,050 8,614,525 25,843,576 12,921,788 6,460,894 3,230,447 9,691,342 4,845,671 14,537,014 7,268,507 21,805,522 10,902,761 32,708,284 16,354,142 8,177,071 24,531,214 12,265,607 36,796,822 18,398,411 55,195,234 27,597,617 82,792,852 41,396,426 20,698,213 62,094,640 31,047,320 15,523,660 7,761,830 3,880,915 11,642,746 5,821,373 17,464,120 8,732,060 4,366,030 2,183,015

← Previous Integer #9,560,891 Browse Full Index Next Integer #9,560,893 →