4,944,006

2 × 3² × 274667

4,944,006 factors as 2 × 3^2 × 274667. Its 12 positive divisors give a proper-divisor sum of 5,768,046, so this integer is abundant. The Collatz stopping time is 144 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 274667

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,712,052

Proper Divisor Sum 5,768,046

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4943963 ← → #4944019

Radix Representation

Decimal	4944006
Binary	10010110111000010000110 (23 bits)
Octal	0o22670206
Hexadecimal	0x4B7086

Divisor Catalog (12)

1 2 3 6 9 18 274,667 549,334 824,001 1,648,002 2,472,003 4,944,006

Collatz Trajectory (144 steps to reach 1)

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

4,944,006 2,472,003 7,416,010 3,708,005 11,124,016 5,562,008 2,781,004 1,390,502 695,251 2,085,754 1,042,877 3,128,632 1,564,316 782,158 391,079 1,173,238 586,619 1,759,858 879,929 2,639,788 1,319,894 659,947 1,979,842 989,921 2,969,764 1,484,882 742,441 2,227,324 1,113,662 556,831 1,670,494 835,247 2,505,742 1,252,871 3,758,614 1,879,307 5,637,922 2,818,961 8,456,884 4,228,442 2,114,221 6,342,664 3,171,332 1,585,666 792,833 2,378,500 1,189,250 594,625 1,783,876 891,938 445,969 1,337,908 668,954 334,477 1,003,432 501,716 250,858 125,429 376,288 188,144

← Previous Integer #4,944,005 Browse Full Index Next Integer #4,944,007 →