1,560,366

2 × 3² × 23 × 3769

1,560,366 factors as 2 × 3^2 × 23 × 3769. Its 24 positive divisors give a proper-divisor sum of 1,968,354, so this integer is abundant. The Collatz stopping time is 155 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 23 × 3769

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 3,528,720

Proper Divisor Sum 1,968,354

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1560313 ← → #1560371

Radix Representation

Decimal	1560366
Binary	101111100111100101110 (21 bits)
Octal	0o5747456
Hexadecimal	0x17CF2E

Divisor Catalog (24)

1 2 3 6 9 18 23 46 69 138 207 414 3,769 7,538 11,307 22,614 33,921 67,842 86,687 173,374 260,061 520,122 780,183 1,560,366

Collatz Trajectory (155 steps to reach 1)

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

1,560,366 780,183 2,340,550 1,170,275 3,510,826 1,755,413 5,266,240 2,633,120 1,316,560 658,280 329,140 164,570 82,285 246,856 123,428 61,714 30,857 92,572 46,286 23,143 69,430 34,715 104,146 52,073 156,220 78,110 39,055 117,166 58,583 175,750 87,875 263,626 131,813 395,440 197,720 98,860 49,430 24,715 74,146 37,073 111,220 55,610 27,805 83,416 41,708 20,854 10,427 31,282 15,641 46,924 23,462 11,731 35,194 17,597 52,792 26,396 13,198 6,599 19,798 9,899

← Previous Integer #1,560,365 Browse Full Index Next Integer #1,560,367 →