4,776,906

2 × 3 × 796151

4,776,906 factors as 2 × 3 × 796151. Its 8 positive divisors give a proper-divisor sum of 4,776,918, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2 × 3 × 796151

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 9,553,824

Proper Divisor Sum 4,776,918

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4776887 ← → #4776907

Radix Representation

Decimal	4776906
Binary	10010001110001111001010 (23 bits)
Octal	0o22161712
Hexadecimal	0x48E3CA

Divisor Catalog (8)

1 2 3 6 796,151 1,592,302 2,388,453 4,776,906

Collatz Trajectory (100 steps to reach 1)

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

4,776,906 2,388,453 7,165,360 3,582,680 1,791,340 895,670 447,835 1,343,506 671,753 2,015,260 1,007,630 503,815 1,511,446 755,723 2,267,170 1,133,585 3,400,756 1,700,378 850,189 2,550,568 1,275,284 637,642 318,821 956,464 478,232 239,116 119,558 59,779 179,338 89,669 269,008 134,504 67,252 33,626 16,813 50,440 25,220 12,610 6,305 18,916 9,458 4,729 14,188 7,094 3,547 10,642 5,321 15,964 7,982 3,991 11,974 5,987 17,962 8,981 26,944 13,472 6,736 3,368 1,684 842

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,776,905 Browse Full Index Next Integer #4,776,907 →