3,561,978

2 × 3 × 7 × 84809

3,561,978 factors as 2 × 3 × 7 × 84809. Its 16 positive divisors give a proper-divisor sum of 4,579,782, so this integer is abundant. The Collatz stopping time is 159 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 84809

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,141,760

Proper Divisor Sum 4,579,782

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3561977 ← → #3561997

Radix Representation

Decimal	3561978
Binary	1101100101100111111010 (22 bits)
Octal	0o15454772
Hexadecimal	0x3659FA

Divisor Catalog (16)

1 2 3 6 7 14 21 42 84,809 169,618 254,427 508,854 593,663 1,187,326 1,780,989 3,561,978

Collatz Trajectory (159 steps to reach 1)

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

3,561,978 1,780,989 5,342,968 2,671,484 1,335,742 667,871 2,003,614 1,001,807 3,005,422 1,502,711 4,508,134 2,254,067 6,762,202 3,381,101 10,143,304 5,071,652 2,535,826 1,267,913 3,803,740 1,901,870 950,935 2,852,806 1,426,403 4,279,210 2,139,605 6,418,816 3,209,408 1,604,704 802,352 401,176 200,588 100,294 50,147 150,442 75,221 225,664 112,832 56,416 28,208 14,104 7,052 3,526 1,763 5,290 2,645 7,936 3,968 1,984 992 496 248 124 62 31 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,561,977 Browse Full Index Next Integer #3,561,979 →