1,950,786

2 × 3² × 108377

1,950,786 factors as 2 × 3^2 × 108377. Its 12 positive divisors give a proper-divisor sum of 2,275,956, so this integer is abundant. The Collatz stopping time is 184 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 108377

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,226,742

Proper Divisor Sum 2,275,956

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #1950763 ← → #1950803

Radix Representation

Decimal	1950786
Binary	111011100010001000010 (21 bits)
Octal	0o7342102
Hexadecimal	0x1DC442

Divisor Catalog (12)

1 2 3 6 9 18 108,377 216,754 325,131 650,262 975,393 1,950,786

Collatz Trajectory (184 steps to reach 1)

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

1,950,786 975,393 2,926,180 1,463,090 731,545 2,194,636 1,097,318 548,659 1,645,978 822,989 2,468,968 1,234,484 617,242 308,621 925,864 462,932 231,466 115,733 347,200 173,600 86,800 43,400 21,700 10,850 5,425 16,276 8,138 4,069 12,208 6,104 3,052 1,526 763 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900 2,450 1,225 3,676 1,838 919 2,758 1,379 4,138 2,069

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,950,785 Browse Full Index Next Integer #1,950,787 →