9,745,044

2² × 3 × 29 × 41 × 683

9,745,044 factors as 2^2 × 3 × 29 × 41 × 683. Its 48 positive divisors give a proper-divisor sum of 14,386,476, so this integer is abundant. The Collatz stopping time is 362 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 29 × 41 × 683

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 24,131,520

Proper Divisor Sum 14,386,476

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9745039 ← → #9745049

Radix Representation

Decimal	9745044
Binary	100101001011001010010100 (24 bits)
Octal	0o45131224
Hexadecimal	0x94B294

Divisor Catalog (48)

1 2 3 4 6 12 29 41 58 82 87 116 123 164 174 246 348 492 683 1,189 1,366 2,049 2,378 2,732 3,567 4,098 4,756 7,134 8,196 14,268 19,807 28,003 39,614 56,006 59,421 79,228 84,009 112,012 118,842 168,018 237,684 336,036 812,087 1,624,174 2,436,261 3,248,348 4,872,522 9,745,044

Collatz Trajectory (362 steps to reach 1)

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

9,745,044 4,872,522 2,436,261 7,308,784 3,654,392 1,827,196 913,598 456,799 1,370,398 685,199 2,055,598 1,027,799 3,083,398 1,541,699 4,625,098 2,312,549 6,937,648 3,468,824 1,734,412 867,206 433,603 1,300,810 650,405 1,951,216 975,608 487,804 243,902 121,951 365,854 182,927 548,782 274,391 823,174 411,587 1,234,762 617,381 1,852,144 926,072 463,036 231,518 115,759 347,278 173,639 520,918 260,459 781,378 390,689 1,172,068 586,034 293,017 879,052 439,526 219,763 659,290 329,645 988,936 494,468 247,234 123,617 370,852

← Previous Integer #9,745,043 Browse Full Index Next Integer #9,745,045 →