1,276,746

2 × 3 × 212791

1,276,746 factors as 2 × 3 × 212791. Its 8 positive divisors give a proper-divisor sum of 1,276,758, so this integer is abundant. The Collatz stopping time is 124 steps.

Prime Factor Structure

Factorization String 2 × 3 × 212791

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,553,504

Proper Divisor Sum 1,276,758

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1276739 ← → #1276747

Radix Representation

Decimal	1276746
Binary	100110111101101001010 (21 bits)
Octal	0o4675512
Hexadecimal	0x137B4A

Divisor Catalog (8)

1 2 3 6 212,791 425,582 638,373 1,276,746

Collatz Trajectory (124 steps to reach 1)

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

1,276,746 638,373 1,915,120 957,560 478,780 239,390 119,695 359,086 179,543 538,630 269,315 807,946 403,973 1,211,920 605,960 302,980 151,490 75,745 227,236 113,618 56,809 170,428 85,214 42,607 127,822 63,911 191,734 95,867 287,602 143,801 431,404 215,702 107,851 323,554 161,777 485,332 242,666 121,333 364,000 182,000 91,000 45,500 22,750 11,375 34,126 17,063 51,190 25,595 76,786 38,393 115,180 57,590 28,795 86,386 43,193 129,580 64,790 32,395 97,186 48,593

← Previous Integer #1,276,745 Browse Full Index Next Integer #1,276,747 →