992,256

2¹⁰ × 3 × 17 × 19

992,256 factors as 2^10 × 3 × 17 × 19. Its 88 positive divisors give a proper-divisor sum of 1,955,424, so this integer is abundant. The Collatz stopping time is 59 steps.

Prime Factor Structure

Factorization String 2^10 × 3 × 17 × 19

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 88

Divisor Sum (σ) 2,947,680

Proper Divisor Sum 1,955,424

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #992249 ← → #992263

Radix Representation

Decimal	992256
Binary	11110010010000000000 (20 bits)
Octal	0o3622000
Hexadecimal	0xF2400

Divisor Catalog (60 of 88)

1 2 3 4 6 8 12 16 17 19 24 32 34 38 48 51 57 64 68 76 96 102 114 128 136 152 192 204 228 256 272 304 323 384 408 456 512 544 608 646 768 816 912 969 1,024 1,088 1,216 1,292 1,536 1,632 1,824 1,938 2,176 2,432 2,584 3,072 3,264 3,648 3,876 4,352

Collatz Trajectory (59 steps to reach 1)

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

992,256 496,128 248,064 124,032 62,016 31,008 15,504 7,752 3,876 1,938 969 2,908 1,454 727 2,182 1,091 3,274 1,637 4,912 2,456 1,228 614 307 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #992,255 Browse Full Index Next Integer #992,257 →