9,004,044

2² × 3 × 7² × 15313

9,004,044 factors as 2^2 × 3 × 7^2 × 15313. Its 36 positive divisors give a proper-divisor sum of 15,437,100, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7^2 × 15313

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 24,441,144

Proper Divisor Sum 15,437,100

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #9004031 ← → #9004057

Radix Representation

Decimal	9004044
Binary	100010010110010000001100 (24 bits)
Octal	0o42262014
Hexadecimal	0x89640C

Divisor Catalog (36)

1 2 3 4 6 7 12 14 21 28 42 49 84 98 147 196 294 588 15,313 30,626 45,939 61,252 91,878 107,191 183,756 214,382 321,573 428,764 643,146 750,337 1,286,292 1,500,674 2,251,011 3,001,348 4,502,022 9,004,044

Collatz Trajectory (88 steps to reach 1)

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

9,004,044 4,502,022 2,251,011 6,753,034 3,376,517 10,129,552 5,064,776 2,532,388 1,266,194 633,097 1,899,292 949,646 474,823 1,424,470 712,235 2,136,706 1,068,353 3,205,060 1,602,530 801,265 2,403,796 1,201,898 600,949 1,802,848 901,424 450,712 225,356 112,678 56,339 169,018 84,509 253,528 126,764 63,382 31,691 95,074 47,537 142,612 71,306 35,653 106,960 53,480 26,740 13,370 6,685 20,056 10,028 5,014 2,507 7,522 3,761 11,284 5,642 2,821 8,464 4,232 2,116 1,058 529 1,588

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