1,543,422

2 × 3 × 61 × 4217

1,543,422 factors as 2 × 3 × 61 × 4217. Its 16 positive divisors give a proper-divisor sum of 1,594,770, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3 × 61 × 4217

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,138,192

Proper Divisor Sum 1,594,770

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1543417 ← → #1543429

Radix Representation

Decimal	1543422
Binary	101111000110011111110 (21 bits)
Octal	0o5706376
Hexadecimal	0x178CFE

Divisor Catalog (16)

1 2 3 6 61 122 183 366 4,217 8,434 12,651 25,302 257,237 514,474 771,711 1,543,422

Collatz Trajectory (132 steps to reach 1)

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

1,543,422 771,711 2,315,134 1,157,567 3,472,702 1,736,351 5,209,054 2,604,527 7,813,582 3,906,791 11,720,374 5,860,187 17,580,562 8,790,281 26,370,844 13,185,422 6,592,711 19,778,134 9,889,067 29,667,202 14,833,601 44,500,804 22,250,402 11,125,201 33,375,604 16,687,802 8,343,901 25,031,704 12,515,852 6,257,926 3,128,963 9,386,890 4,693,445 14,080,336 7,040,168 3,520,084 1,760,042 880,021 2,640,064 1,320,032 660,016 330,008 165,004 82,502 41,251 123,754 61,877 185,632 92,816 46,408 23,204 11,602 5,801 17,404 8,702 4,351 13,054 6,527 19,582 9,791

← Previous Integer #1,543,421 Browse Full Index Next Integer #1,543,423 →