1,692,030

2 × 3 × 5 × 56401

1,692,030 factors as 2 × 3 × 5 × 56401. Its 16 positive divisors give a proper-divisor sum of 2,368,914, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 56401

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,060,944

Proper Divisor Sum 2,368,914

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1692023 ← → #1692043

Radix Representation

Decimal	1692030
Binary	110011101000101111110 (21 bits)
Octal	0o6350576
Hexadecimal	0x19D17E

Divisor Catalog (16)

1 2 3 5 6 10 15 30 56,401 112,802 169,203 282,005 338,406 564,010 846,015 1,692,030

Collatz Trajectory (176 steps to reach 1)

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

1,692,030 846,015 2,538,046 1,269,023 3,807,070 1,903,535 5,710,606 2,855,303 8,565,910 4,282,955 12,848,866 6,424,433 19,273,300 9,636,650 4,818,325 14,454,976 7,227,488 3,613,744 1,806,872 903,436 451,718 225,859 677,578 338,789 1,016,368 508,184 254,092 127,046 63,523 190,570 95,285 285,856 142,928 71,464 35,732 17,866 8,933 26,800 13,400 6,700 3,350 1,675 5,026 2,513 7,540 3,770 1,885 5,656 2,828 1,414 707 2,122 1,061 3,184 1,592 796 398 199 598 299

← Previous Integer #1,692,029 Browse Full Index Next Integer #1,692,031 →