996,258

2 × 3 × 166043

996,258 factors as 2 × 3 × 166043. Its 8 positive divisors give a proper-divisor sum of 996,270, so this integer is abundant. The Collatz stopping time is 258 steps.

Prime Factor Structure

Factorization String 2 × 3 × 166043

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,992,528

Proper Divisor Sum 996,270

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #996257 ← → #996263

Radix Representation

Decimal	996258
Binary	11110011001110100010 (20 bits)
Octal	0o3631642
Hexadecimal	0xF33A2

Divisor Catalog (8)

1 2 3 6 166,043 332,086 498,129 996,258

Collatz Trajectory (258 steps to reach 1)

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

996,258 498,129 1,494,388 747,194 373,597 1,120,792 560,396 280,198 140,099 420,298 210,149 630,448 315,224 157,612 78,806 39,403 118,210 59,105 177,316 88,658 44,329 132,988 66,494 33,247 99,742 49,871 149,614 74,807 224,422 112,211 336,634 168,317 504,952 252,476 126,238 63,119 189,358 94,679 284,038 142,019 426,058 213,029 639,088 319,544 159,772 79,886 39,943 119,830 59,915 179,746 89,873 269,620 134,810 67,405 202,216 101,108 50,554 25,277 75,832 37,916

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #996,257 Browse Full Index Next Integer #996,259 →