1,965,342

2 × 3 × 327557

1,965,342 factors as 2 × 3 × 327557. Its 8 positive divisors give a proper-divisor sum of 1,965,354, so this integer is abundant. The Collatz stopping time is 78 steps.

Prime Factor Structure

Factorization String 2 × 3 × 327557

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,930,696

Proper Divisor Sum 1,965,354

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1965323 ← → #1965347

Radix Representation

Decimal	1965342
Binary	111011111110100011110 (21 bits)
Octal	0o7376436
Hexadecimal	0x1DFD1E

Divisor Catalog (8)

1 2 3 6 327,557 655,114 982,671 1,965,342

Collatz Trajectory (78 steps to reach 1)

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

1,965,342 982,671 2,948,014 1,474,007 4,422,022 2,211,011 6,633,034 3,316,517 9,949,552 4,974,776 2,487,388 1,243,694 621,847 1,865,542 932,771 2,798,314 1,399,157 4,197,472 2,098,736 1,049,368 524,684 262,342 131,171 393,514 196,757 590,272 295,136 147,568 73,784 36,892 18,446 9,223 27,670 13,835 41,506 20,753 62,260 31,130 15,565 46,696 23,348 11,674 5,837 17,512 8,756 4,378 2,189 6,568 3,284 1,642 821 2,464 1,232 616 308 154 77 232 116 58

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,965,341 Browse Full Index Next Integer #1,965,343 →