1,671,936

2⁸ × 3 × 7 × 311

1,671,936 factors as 2^8 × 3 × 7 × 311. Its 72 positive divisors give a proper-divisor sum of 3,429,888, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^8 × 3 × 7 × 311

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 5,101,824

Proper Divisor Sum 3,429,888

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1671907 ← → #1671941

Radix Representation

Decimal	1671936
Binary	110011000001100000000 (21 bits)
Octal	0o6301400
Hexadecimal	0x198300

Divisor Catalog (60 of 72)

1 2 3 4 6 7 8 12 14 16 21 24 28 32 42 48 56 64 84 96 112 128 168 192 224 256 311 336 384 448 622 672 768 896 933 1,244 1,344 1,792 1,866 2,177 2,488 2,688 3,732 4,354 4,976 5,376 6,531 7,464 8,708 9,952 13,062 14,928 17,416 19,904 26,124 29,856 34,832 39,808 52,248 59,712

Collatz Trajectory (145 steps to reach 1)

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

1,671,936 835,968 417,984 208,992 104,496 52,248 26,124 13,062 6,531 19,594 9,797 29,392 14,696 7,348 3,674 1,837 5,512 2,756 1,378 689 2,068 1,034 517 1,552 776 388 194 97 292 146 73 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310

← Previous Integer #1,671,935 Browse Full Index Next Integer #1,671,937 →