4,404,858

2 × 3 × 734143

4,404,858 factors as 2 × 3 × 734143. Its 8 positive divisors give a proper-divisor sum of 4,404,870, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2 × 3 × 734143

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,809,728

Proper Divisor Sum 4,404,870

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4404857 ← → #4404859

Radix Representation

Decimal	4404858
Binary	10000110011011001111010 (23 bits)
Octal	0o20633172
Hexadecimal	0x43367A

Divisor Catalog (8)

1 2 3 6 734,143 1,468,286 2,202,429 4,404,858

Collatz Trajectory (167 steps to reach 1)

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

4,404,858 2,202,429 6,607,288 3,303,644 1,651,822 825,911 2,477,734 1,238,867 3,716,602 1,858,301 5,574,904 2,787,452 1,393,726 696,863 2,090,590 1,045,295 3,135,886 1,567,943 4,703,830 2,351,915 7,055,746 3,527,873 10,583,620 5,291,810 2,645,905 7,937,716 3,968,858 1,984,429 5,953,288 2,976,644 1,488,322 744,161 2,232,484 1,116,242 558,121 1,674,364 837,182 418,591 1,255,774 627,887 1,883,662 941,831 2,825,494 1,412,747 4,238,242 2,119,121 6,357,364 3,178,682 1,589,341 4,768,024 2,384,012 1,192,006 596,003 1,788,010 894,005 2,682,016 1,341,008 670,504 335,252 167,626

← Previous Integer #4,404,857 Browse Full Index Next Integer #4,404,859 →