9,536,940

2² × 3⁴ × 5 × 7 × 29²

9,536,940 factors as 2^2 × 3^4 × 5 × 7 × 29^2. Its 180 positive divisors give a proper-divisor sum of 25,874,436, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^2 × 3^4 × 5 × 7 × 29^2

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 180

Divisor Sum (σ) 35,411,376

Proper Divisor Sum 25,874,436

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9536909 ← → #9536953

Radix Representation

Decimal	9536940
Binary	100100011000010110101100 (24 bits)
Octal	0o44302654
Hexadecimal	0x9185AC

Divisor Catalog (60 of 180)

1 2 3 4 5 6 7 9 10 12 14 15 18 20 21 27 28 29 30 35 36 42 45 54 58 60 63 70 81 84 87 90 105 108 116 126 135 140 145 162 174 180 189 203 210 252 261 270 290 315 324 348 378 405 406 420 435 522 540 567

Collatz Trajectory (101 steps to reach 1)

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

9,536,940 4,768,470 2,384,235 7,152,706 3,576,353 10,729,060 5,364,530 2,682,265 8,046,796 4,023,398 2,011,699 6,035,098 3,017,549 9,052,648 4,526,324 2,263,162 1,131,581 3,394,744 1,697,372 848,686 424,343 1,273,030 636,515 1,909,546 954,773 2,864,320 1,432,160 716,080 358,040 179,020 89,510 44,755 134,266 67,133 201,400 100,700 50,350 25,175 75,526 37,763 113,290 56,645 169,936 84,968 42,484 21,242 10,621 31,864 15,932 7,966 3,983 11,950 5,975 17,926 8,963 26,890 13,445 40,336 20,168 10,084

← Previous Integer #9,536,939 Browse Full Index Next Integer #9,536,941 →