3,652,602

2 × 3 × 608767

3,652,602 factors as 2 × 3 × 608767. Its 8 positive divisors give a proper-divisor sum of 3,652,614, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2 × 3 × 608767

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,305,216

Proper Divisor Sum 3,652,614

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3652591 ← → #3652609

Radix Representation

Decimal	3652602
Binary	1101111011101111111010 (22 bits)
Octal	0o15735772
Hexadecimal	0x37BBFA

Divisor Catalog (8)

1 2 3 6 608,767 1,217,534 1,826,301 3,652,602

Collatz Trajectory (172 steps to reach 1)

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

3,652,602 1,826,301 5,478,904 2,739,452 1,369,726 684,863 2,054,590 1,027,295 3,081,886 1,540,943 4,622,830 2,311,415 6,934,246 3,467,123 10,401,370 5,200,685 15,602,056 7,801,028 3,900,514 1,950,257 5,850,772 2,925,386 1,462,693 4,388,080 2,194,040 1,097,020 548,510 274,255 822,766 411,383 1,234,150 617,075 1,851,226 925,613 2,776,840 1,388,420 694,210 347,105 1,041,316 520,658 260,329 780,988 390,494 195,247 585,742 292,871 878,614 439,307 1,317,922 658,961 1,976,884 988,442 494,221 1,482,664 741,332 370,666 185,333 556,000 278,000 139,000

← Previous Integer #3,652,601 Browse Full Index Next Integer #3,652,603 →