1,060,386

2 × 3 × 31 × 5701

1,060,386 factors as 2 × 3 × 31 × 5701. Its 16 positive divisors give a proper-divisor sum of 1,129,182, so this integer is abundant. The Collatz stopping time is 196 steps.

Prime Factor Structure

Factorization String 2 × 3 × 31 × 5701

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,189,568

Proper Divisor Sum 1,129,182

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1060379 ← → #1060391

Radix Representation

Decimal	1060386
Binary	100000010111000100010 (21 bits)
Octal	0o4027042
Hexadecimal	0x102E22

Divisor Catalog (16)

1 2 3 6 31 62 93 186 5,701 11,402 17,103 34,206 176,731 353,462 530,193 1,060,386

Collatz Trajectory (196 steps to reach 1)

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

1,060,386 530,193 1,590,580 795,290 397,645 1,192,936 596,468 298,234 149,117 447,352 223,676 111,838 55,919 167,758 83,879 251,638 125,819 377,458 188,729 566,188 283,094 141,547 424,642 212,321 636,964 318,482 159,241 477,724 238,862 119,431 358,294 179,147 537,442 268,721 806,164 403,082 201,541 604,624 302,312 151,156 75,578 37,789 113,368 56,684 28,342 14,171 42,514 21,257 63,772 31,886 15,943 47,830 23,915 71,746 35,873 107,620 53,810 26,905 80,716 40,358

← Previous Integer #1,060,385 Browse Full Index Next Integer #1,060,387 →