3,658,560

2⁶ × 3 × 5 × 37 × 103

3,658,560 factors as 2^6 × 3 × 5 × 37 × 103. Its 112 positive divisors give a proper-divisor sum of 8,387,136, so this integer is abundant. The Collatz stopping time is 203 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 5 × 37 × 103

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 112

Divisor Sum (σ) 12,045,696

Proper Divisor Sum 8,387,136

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3658547 ← → #3658607

Radix Representation

Decimal	3658560
Binary	1101111101001101000000 (22 bits)
Octal	0o15751500
Hexadecimal	0x37D340

Divisor Catalog (60 of 112)

1 2 3 4 5 6 8 10 12 15 16 20 24 30 32 37 40 48 60 64 74 80 96 103 111 120 148 160 185 192 206 222 240 296 309 320 370 412 444 480 515 555 592 618 740 824 888 960 1,030 1,110 1,184 1,236 1,480 1,545 1,648 1,776 2,060 2,220 2,368 2,472

Collatz Trajectory (203 steps to reach 1)

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

3,658,560 1,829,280 914,640 457,320 228,660 114,330 57,165 171,496 85,748 42,874 21,437 64,312 32,156 16,078 8,039 24,118 12,059 36,178 18,089 54,268 27,134 13,567 40,702 20,351 61,054 30,527 91,582 45,791 137,374 68,687 206,062 103,031 309,094 154,547 463,642 231,821 695,464 347,732 173,866 86,933 260,800 130,400 65,200 32,600 16,300 8,150 4,075 12,226 6,113 18,340 9,170 4,585 13,756 6,878 3,439 10,318 5,159 15,478 7,739 23,218

← Previous Integer #3,658,559 Browse Full Index Next Integer #3,658,561 →