3,658,080

2⁵ × 3 × 5 × 7621

3,658,080 factors as 2^5 × 3 × 5 × 7621. Its 48 positive divisors give a proper-divisor sum of 7,866,384, so this integer is abundant. The Collatz stopping time is 203 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 5 × 7621

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 11,524,464

Proper Divisor Sum 7,866,384

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3658073 ← → #3658087

Radix Representation

Decimal	3658080
Binary	1101111101000101100000 (22 bits)
Octal	0o15750540
Hexadecimal	0x37D160

Divisor Catalog (48)

1 2 3 4 5 6 8 10 12 15 16 20 24 30 32 40 48 60 80 96 120 160 240 480 7,621 15,242 22,863 30,484 38,105 45,726 60,968 76,210 91,452 114,315 121,936 152,420 182,904 228,630 243,872 304,840 365,808 457,260 609,680 731,616 914,520 1,219,360 1,829,040 3,658,080

Collatz Trajectory (203 steps to reach 1)

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

3,658,080 1,829,040 914,520 457,260 228,630 114,315 342,946 171,473 514,420 257,210 128,605 385,816 192,908 96,454 48,227 144,682 72,341 217,024 108,512 54,256 27,128 13,564 6,782 3,391 10,174 5,087 15,262 7,631 22,894 11,447 34,342 17,171 51,514 25,757 77,272 38,636 19,318 9,659 28,978 14,489 43,468 21,734 10,867 32,602 16,301 48,904 24,452 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,079 Browse Full Index Next Integer #3,658,081 →