3,326,752

2⁵ × 11 × 13 × 727

3,326,752 factors as 2^5 × 11 × 13 × 727. Its 48 positive divisors give a proper-divisor sum of 4,378,400, so this integer is abundant. The Collatz stopping time is 208 steps.

Prime Factor Structure

Factorization String 2^5 × 11 × 13 × 727

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 7,705,152

Proper Divisor Sum 4,378,400

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #3326717 ← → #3326753

Radix Representation

Decimal	3326752
Binary	1100101100001100100000 (22 bits)
Octal	0o14541440
Hexadecimal	0x32C320

Divisor Catalog (48)

1 2 4 8 11 13 16 22 26 32 44 52 88 104 143 176 208 286 352 416 572 727 1,144 1,454 2,288 2,908 4,576 5,816 7,997 9,451 11,632 15,994 18,902 23,264 31,988 37,804 63,976 75,608 103,961 127,952 151,216 207,922 255,904 302,432 415,844 831,688 1,663,376 3,326,752

Collatz Trajectory (208 steps to reach 1)

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

3,326,752 1,663,376 831,688 415,844 207,922 103,961 311,884 155,942 77,971 233,914 116,957 350,872 175,436 87,718 43,859 131,578 65,789 197,368 98,684 49,342 24,671 74,014 37,007 111,022 55,511 166,534 83,267 249,802 124,901 374,704 187,352 93,676 46,838 23,419 70,258 35,129 105,388 52,694 26,347 79,042 39,521 118,564 59,282 29,641 88,924 44,462 22,231 66,694 33,347 100,042 50,021 150,064 75,032 37,516 18,758 9,379 28,138 14,069 42,208 21,104

← Previous Integer #3,326,751 Browse Full Index Next Integer #3,326,753 →