1,727,970

2 × 3 × 5 × 239 × 241

1,727,970 factors as 2 × 3 × 5 × 239 × 241. Its 32 positive divisors give a proper-divisor sum of 2,453,790, so this integer is abundant. The Collatz stopping time is 189 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 239 × 241

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 4,181,760

Proper Divisor Sum 2,453,790

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1727969 ← → #1727987

Radix Representation

Decimal	1727970
Binary	110100101110111100010 (21 bits)
Octal	0o6456742
Hexadecimal	0x1A5DE2

Divisor Catalog (32)

1 2 3 5 6 10 15 30 239 241 478 482 717 723 1,195 1,205 1,434 1,446 2,390 2,410 3,585 3,615 7,170 7,230 57,599 115,198 172,797 287,995 345,594 575,990 863,985 1,727,970

Collatz Trajectory (189 steps to reach 1)

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

1,727,970 863,985 2,591,956 1,295,978 647,989 1,943,968 971,984 485,992 242,996 121,498 60,749 182,248 91,124 45,562 22,781 68,344 34,172 17,086 8,543 25,630 12,815 38,446 19,223 57,670 28,835 86,506 43,253 129,760 64,880 32,440 16,220 8,110 4,055 12,166 6,083 18,250 9,125 27,376 13,688 6,844 3,422 1,711 5,134 2,567 7,702 3,851 11,554 5,777 17,332 8,666 4,333 13,000 6,500 3,250 1,625 4,876 2,438 1,219 3,658 1,829

← Previous Integer #1,727,969 Browse Full Index Next Integer #1,727,971 →