9,705,740

2² × 5 × 11 × 157 × 281

9,705,740 factors as 2^2 × 5 × 11 × 157 × 281. Its 48 positive divisors give a proper-divisor sum of 12,750,484, so this integer is abundant. The Collatz stopping time is 238 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 11 × 157 × 281

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 22,456,224

Proper Divisor Sum 12,750,484

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #9705733 ← → #9705743

Radix Representation

Decimal	9705740
Binary	100101000001100100001100 (24 bits)
Octal	0o45014414
Hexadecimal	0x94190C

Divisor Catalog (48)

1 2 4 5 10 11 20 22 44 55 110 157 220 281 314 562 628 785 1,124 1,405 1,570 1,727 2,810 3,091 3,140 3,454 5,620 6,182 6,908 8,635 12,364 15,455 17,270 30,910 34,540 44,117 61,820 88,234 176,468 220,585 441,170 485,287 882,340 970,574 1,941,148 2,426,435 4,852,870 9,705,740

Collatz Trajectory (238 steps to reach 1)

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

9,705,740 4,852,870 2,426,435 7,279,306 3,639,653 10,918,960 5,459,480 2,729,740 1,364,870 682,435 2,047,306 1,023,653 3,070,960 1,535,480 767,740 383,870 191,935 575,806 287,903 863,710 431,855 1,295,566 647,783 1,943,350 971,675 2,915,026 1,457,513 4,372,540 2,186,270 1,093,135 3,279,406 1,639,703 4,919,110 2,459,555 7,378,666 3,689,333 11,068,000 5,534,000 2,767,000 1,383,500 691,750 345,875 1,037,626 518,813 1,556,440 778,220 389,110 194,555 583,666 291,833 875,500 437,750 218,875 656,626 328,313 984,940 492,470 246,235 738,706 369,353

← Previous Integer #9,705,739 Browse Full Index Next Integer #9,705,741 →