4,394,916

2² × 3² × 122081

4,394,916 factors as 2^2 × 3^2 × 122081. Its 18 positive divisors give a proper-divisor sum of 6,714,546, so this integer is abundant. The Collatz stopping time is 211 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 122081

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 11,109,462

Proper Divisor Sum 6,714,546

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4394911 ← → #4394917

Radix Representation

Decimal	4394916
Binary	10000110000111110100100 (23 bits)
Octal	0o20607644
Hexadecimal	0x430FA4

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 122,081 244,162 366,243 488,324 732,486 1,098,729 1,464,972 2,197,458 4,394,916

Collatz Trajectory (211 steps to reach 1)

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

4,394,916 2,197,458 1,098,729 3,296,188 1,648,094 824,047 2,472,142 1,236,071 3,708,214 1,854,107 5,562,322 2,781,161 8,343,484 4,171,742 2,085,871 6,257,614 3,128,807 9,386,422 4,693,211 14,079,634 7,039,817 21,119,452 10,559,726 5,279,863 15,839,590 7,919,795 23,759,386 11,879,693 35,639,080 17,819,540 8,909,770 4,454,885 13,364,656 6,682,328 3,341,164 1,670,582 835,291 2,505,874 1,252,937 3,758,812 1,879,406 939,703 2,819,110 1,409,555 4,228,666 2,114,333 6,343,000 3,171,500 1,585,750 792,875 2,378,626 1,189,313 3,567,940 1,783,970 891,985 2,675,956 1,337,978 668,989 2,006,968 1,003,484

← Previous Integer #4,394,915 Browse Full Index Next Integer #4,394,917 →