896,286

2 × 3 × 149381

896,286 factors as 2 × 3 × 149381. Its 8 positive divisors give a proper-divisor sum of 896,298, so this integer is abundant. The Collatz stopping time is 232 steps.

Prime Factor Structure

Factorization String 2 × 3 × 149381

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,792,584

Proper Divisor Sum 896,298

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #896281 ← → #896293

Radix Representation

Decimal	896286
Binary	11011010110100011110 (20 bits)
Octal	0o3326436
Hexadecimal	0xDAD1E

Divisor Catalog (8)

1 2 3 6 149,381 298,762 448,143 896,286

Collatz Trajectory (232 steps to reach 1)

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

896,286 448,143 1,344,430 672,215 2,016,646 1,008,323 3,024,970 1,512,485 4,537,456 2,268,728 1,134,364 567,182 283,591 850,774 425,387 1,276,162 638,081 1,914,244 957,122 478,561 1,435,684 717,842 358,921 1,076,764 538,382 269,191 807,574 403,787 1,211,362 605,681 1,817,044 908,522 454,261 1,362,784 681,392 340,696 170,348 85,174 42,587 127,762 63,881 191,644 95,822 47,911 143,734 71,867 215,602 107,801 323,404 161,702 80,851 242,554 121,277 363,832 181,916 90,958 45,479 136,438 68,219 204,658

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #896,285 Browse Full Index Next Integer #896,287 →