1,661,202

2 × 3³ × 30763

1,661,202 factors as 2 × 3^3 × 30763. Its 16 positive divisors give a proper-divisor sum of 2,030,478, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 30763

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,691,680

Proper Divisor Sum 2,030,478

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #1661173 ← → #1661237

Radix Representation

Decimal	1661202
Binary	110010101100100010010 (21 bits)
Octal	0o6254422
Hexadecimal	0x195912

Divisor Catalog (16)

1 2 3 6 9 18 27 54 30,763 61,526 92,289 184,578 276,867 553,734 830,601 1,661,202

Collatz Trajectory (176 steps to reach 1)

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

1,661,202 830,601 2,491,804 1,245,902 622,951 1,868,854 934,427 2,803,282 1,401,641 4,204,924 2,102,462 1,051,231 3,153,694 1,576,847 4,730,542 2,365,271 7,095,814 3,547,907 10,643,722 5,321,861 15,965,584 7,982,792 3,991,396 1,995,698 997,849 2,993,548 1,496,774 748,387 2,245,162 1,122,581 3,367,744 1,683,872 841,936 420,968 210,484 105,242 52,621 157,864 78,932 39,466 19,733 59,200 29,600 14,800 7,400 3,700 1,850 925 2,776 1,388 694 347 1,042 521 1,564 782 391 1,174 587 1,762

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,661,201 Browse Full Index Next Integer #1,661,203 →