9,537,780

2² × 3 × 5 × 7 × 22709

9,537,780 factors as 2^2 × 3 × 5 × 7 × 22709. Its 48 positive divisors give a proper-divisor sum of 20,984,460, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 7 × 22709

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 30,522,240

Proper Divisor Sum 20,984,460

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9537769 ← → #9537793

Radix Representation

Decimal	9537780
Binary	100100011000100011110100 (24 bits)
Octal	0o44304364
Hexadecimal	0x9188F4

Divisor Catalog (48)

1 2 3 4 5 6 7 10 12 14 15 20 21 28 30 35 42 60 70 84 105 140 210 420 22,709 45,418 68,127 90,836 113,545 136,254 158,963 227,090 272,508 317,926 340,635 454,180 476,889 635,852 681,270 794,815 953,778 1,362,540 1,589,630 1,907,556 2,384,445 3,179,260 4,768,890 9,537,780

Collatz Trajectory (145 steps to reach 1)

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

9,537,780 4,768,890 2,384,445 7,153,336 3,576,668 1,788,334 894,167 2,682,502 1,341,251 4,023,754 2,011,877 6,035,632 3,017,816 1,508,908 754,454 377,227 1,131,682 565,841 1,697,524 848,762 424,381 1,273,144 636,572 318,286 159,143 477,430 238,715 716,146 358,073 1,074,220 537,110 268,555 805,666 402,833 1,208,500 604,250 302,125 906,376 453,188 226,594 113,297 339,892 169,946 84,973 254,920 127,460 63,730 31,865 95,596 47,798 23,899 71,698 35,849 107,548 53,774 26,887 80,662 40,331 120,994 60,497

← Previous Integer #9,537,779 Browse Full Index Next Integer #9,537,781 →