4,442,574

2 × 3 × 740429

4,442,574 factors as 2 × 3 × 740429. Its 8 positive divisors give a proper-divisor sum of 4,442,586, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2 × 3 × 740429

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,885,160

Proper Divisor Sum 4,442,586

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4442573 ← → #4442609

Radix Representation

Decimal	4442574
Binary	10000111100100111001110 (23 bits)
Octal	0o20744716
Hexadecimal	0x43C9CE

Divisor Catalog (8)

1 2 3 6 740,429 1,480,858 2,221,287 4,442,574

Collatz Trajectory (167 steps to reach 1)

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

4,442,574 2,221,287 6,663,862 3,331,931 9,995,794 4,997,897 14,993,692 7,496,846 3,748,423 11,245,270 5,622,635 16,867,906 8,433,953 25,301,860 12,650,930 6,325,465 18,976,396 9,488,198 4,744,099 14,232,298 7,116,149 21,348,448 10,674,224 5,337,112 2,668,556 1,334,278 667,139 2,001,418 1,000,709 3,002,128 1,501,064 750,532 375,266 187,633 562,900 281,450 140,725 422,176 211,088 105,544 52,772 26,386 13,193 39,580 19,790 9,895 29,686 14,843 44,530 22,265 66,796 33,398 16,699 50,098 25,049 75,148 37,574 18,787 56,362 28,181

← Previous Integer #4,442,573 Browse Full Index Next Integer #4,442,575 →