3,215,976

2³ × 3 × 133999

3,215,976 factors as 2^3 × 3 × 133999. Its 16 positive divisors give a proper-divisor sum of 4,824,024, so this integer is abundant. The Collatz stopping time is 177 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 133999

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,040,000

Proper Divisor Sum 4,824,024

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3215963 ← → #3215977

Radix Representation

Decimal	3215976
Binary	1100010001001001101000 (22 bits)
Octal	0o14211150
Hexadecimal	0x311268

Divisor Catalog (16)

1 2 3 4 6 8 12 24 133,999 267,998 401,997 535,996 803,994 1,071,992 1,607,988 3,215,976

Collatz Trajectory (177 steps to reach 1)

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

3,215,976 1,607,988 803,994 401,997 1,205,992 602,996 301,498 150,749 452,248 226,124 113,062 56,531 169,594 84,797 254,392 127,196 63,598 31,799 95,398 47,699 143,098 71,549 214,648 107,324 53,662 26,831 80,494 40,247 120,742 60,371 181,114 90,557 271,672 135,836 67,918 33,959 101,878 50,939 152,818 76,409 229,228 114,614 57,307 171,922 85,961 257,884 128,942 64,471 193,414 96,707 290,122 145,061 435,184 217,592 108,796 54,398 27,199 81,598 40,799 122,398

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,215,975 Browse Full Index Next Integer #3,215,977 →