3,565,686

2 × 3 × 594281

3,565,686 factors as 2 × 3 × 594281. Its 8 positive divisors give a proper-divisor sum of 3,565,698, so this integer is abundant. The Collatz stopping time is 120 steps.

Prime Factor Structure

Factorization String 2 × 3 × 594281

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,131,384

Proper Divisor Sum 3,565,698

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3565669 ← → #3565687

Radix Representation

Decimal	3565686
Binary	1101100110100001110110 (22 bits)
Octal	0o15464166
Hexadecimal	0x366876

Divisor Catalog (8)

1 2 3 6 594,281 1,188,562 1,782,843 3,565,686

Collatz Trajectory (120 steps to reach 1)

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

3,565,686 1,782,843 5,348,530 2,674,265 8,022,796 4,011,398 2,005,699 6,017,098 3,008,549 9,025,648 4,512,824 2,256,412 1,128,206 564,103 1,692,310 846,155 2,538,466 1,269,233 3,807,700 1,903,850 951,925 2,855,776 1,427,888 713,944 356,972 178,486 89,243 267,730 133,865 401,596 200,798 100,399 301,198 150,599 451,798 225,899 677,698 338,849 1,016,548 508,274 254,137 762,412 381,206 190,603 571,810 285,905 857,716 428,858 214,429 643,288 321,644 160,822 80,411 241,234 120,617 361,852 180,926 90,463 271,390 135,695

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,565,685 Browse Full Index Next Integer #3,565,687 →