3,601,856

2⁶ × 167 × 337

3,601,856 factors as 2^6 × 167 × 337. Its 28 positive divisors give a proper-divisor sum of 3,609,712, so this integer is abundant. The Collatz stopping time is 234 steps.

Prime Factor Structure

Factorization String 2^6 × 167 × 337

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 7,211,568

Proper Divisor Sum 3,609,712

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #3601837 ← → #3601877

Radix Representation

Decimal	3601856
Binary	1101101111010111000000 (22 bits)
Octal	0o15572700
Hexadecimal	0x36F5C0

Divisor Catalog (28)

1 2 4 8 16 32 64 167 334 337 668 674 1,336 1,348 2,672 2,696 5,344 5,392 10,688 10,784 21,568 56,279 112,558 225,116 450,232 900,464 1,800,928 3,601,856

Collatz Trajectory (234 steps to reach 1)

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

3,601,856 1,800,928 900,464 450,232 225,116 112,558 56,279 168,838 84,419 253,258 126,629 379,888 189,944 94,972 47,486 23,743 71,230 35,615 106,846 53,423 160,270 80,135 240,406 120,203 360,610 180,305 540,916 270,458 135,229 405,688 202,844 101,422 50,711 152,134 76,067 228,202 114,101 342,304 171,152 85,576 42,788 21,394 10,697 32,092 16,046 8,023 24,070 12,035 36,106 18,053 54,160 27,080 13,540 6,770 3,385 10,156 5,078 2,539 7,618 3,809

← Previous Integer #3,601,855 Browse Full Index Next Integer #3,601,857 →