3,583,806

2 × 3 × 597301

3,583,806 factors as 2 × 3 × 597301. Its 8 positive divisors give a proper-divisor sum of 3,583,818, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2 × 3 × 597301

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,167,624

Proper Divisor Sum 3,583,818

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3583793 ← → #3583819

Radix Representation

Decimal	3583806
Binary	1101101010111100111110 (22 bits)
Octal	0o15527476
Hexadecimal	0x36AF3E

Divisor Catalog (8)

1 2 3 6 597,301 1,194,602 1,791,903 3,583,806

Collatz Trajectory (97 steps to reach 1)

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

3,583,806 1,791,903 5,375,710 2,687,855 8,063,566 4,031,783 12,095,350 6,047,675 18,143,026 9,071,513 27,214,540 13,607,270 6,803,635 20,410,906 10,205,453 30,616,360 15,308,180 7,654,090 3,827,045 11,481,136 5,740,568 2,870,284 1,435,142 717,571 2,152,714 1,076,357 3,229,072 1,614,536 807,268 403,634 201,817 605,452 302,726 151,363 454,090 227,045 681,136 340,568 170,284 85,142 42,571 127,714 63,857 191,572 95,786 47,893 143,680 71,840 35,920 17,960 8,980 4,490 2,245 6,736 3,368 1,684 842 421 1,264 632

← Previous Integer #3,583,805 Browse Full Index Next Integer #3,583,807 →