867,282

2 × 3 × 13 × 11119

867,282 factors as 2 × 3 × 13 × 11119. Its 16 positive divisors give a proper-divisor sum of 1,000,878, so this integer is abundant. The Collatz stopping time is 188 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 11119

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,868,160

Proper Divisor Sum 1,000,878

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #867281 ← → #867301

Radix Representation

Decimal	867282
Binary	11010011101111010010 (20 bits)
Octal	0o3235722
Hexadecimal	0xD3BD2

Divisor Catalog (16)

1 2 3 6 13 26 39 78 11,119 22,238 33,357 66,714 144,547 289,094 433,641 867,282

Collatz Trajectory (188 steps to reach 1)

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

867,282 433,641 1,300,924 650,462 325,231 975,694 487,847 1,463,542 731,771 2,195,314 1,097,657 3,292,972 1,646,486 823,243 2,469,730 1,234,865 3,704,596 1,852,298 926,149 2,778,448 1,389,224 694,612 347,306 173,653 520,960 260,480 130,240 65,120 32,560 16,280 8,140 4,070 2,035 6,106 3,053 9,160 4,580 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900 2,450 1,225 3,676 1,838 919

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #867,281 Browse Full Index Next Integer #867,283 →