9,755,508

2² × 3 × 7² × 47 × 353

9,755,508 factors as 2^2 × 3 × 7^2 × 47 × 353. Its 72 positive divisors give a proper-divisor sum of 17,363,724, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7^2 × 47 × 353

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 27,119,232

Proper Divisor Sum 17,363,724

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9755507 ← → #9755521

Radix Representation

Decimal	9755508
Binary	100101001101101101110100 (24 bits)
Octal	0o45155564
Hexadecimal	0x94DB74

Divisor Catalog (60 of 72)

1 2 3 4 6 7 12 14 21 28 42 47 49 84 94 98 141 147 188 196 282 294 329 353 564 588 658 706 987 1,059 1,316 1,412 1,974 2,118 2,303 2,471 3,948 4,236 4,606 4,942 6,909 7,413 9,212 9,884 13,818 14,826 16,591 17,297 27,636 29,652 33,182 34,594 49,773 51,891 66,364 69,188 99,546 103,782 116,137 199,092

Collatz Trajectory (101 steps to reach 1)

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

9,755,508 4,877,754 2,438,877 7,316,632 3,658,316 1,829,158 914,579 2,743,738 1,371,869 4,115,608 2,057,804 1,028,902 514,451 1,543,354 771,677 2,315,032 1,157,516 578,758 289,379 868,138 434,069 1,302,208 651,104 325,552 162,776 81,388 40,694 20,347 61,042 30,521 91,564 45,782 22,891 68,674 34,337 103,012 51,506 25,753 77,260 38,630 19,315 57,946 28,973 86,920 43,460 21,730 10,865 32,596 16,298 8,149 24,448 12,224 6,112 3,056 1,528 764 382 191 574 287

← Previous Integer #9,755,507 Browse Full Index Next Integer #9,755,509 →