3,564,904

2³ × 7 × 63659

3,564,904 factors as 2^3 × 7 × 63659. Its 16 positive divisors give a proper-divisor sum of 4,074,296, so this integer is abundant. The Collatz stopping time is 159 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 63659

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,639,200

Proper Divisor Sum 4,074,296

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3564893 ← → #3564923

Radix Representation

Decimal	3564904
Binary	1101100110010101101000 (22 bits)
Octal	0o15462550
Hexadecimal	0x366568

Divisor Catalog (16)

1 2 4 7 8 14 28 56 63,659 127,318 254,636 445,613 509,272 891,226 1,782,452 3,564,904

Collatz Trajectory (159 steps to reach 1)

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

3,564,904 1,782,452 891,226 445,613 1,336,840 668,420 334,210 167,105 501,316 250,658 125,329 375,988 187,994 93,997 281,992 140,996 70,498 35,249 105,748 52,874 26,437 79,312 39,656 19,828 9,914 4,957 14,872 7,436 3,718 1,859 5,578 2,789 8,368 4,184 2,092 1,046 523 1,570 785 2,356 1,178 589 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47 142 71 214 107

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,564,903 Browse Full Index Next Integer #3,564,905 →