3,658,128

2⁴ × 3 × 17 × 4483

3,658,128 factors as 2^4 × 3 × 17 × 4483. Its 40 positive divisors give a proper-divisor sum of 6,350,160, so this integer is abundant. The Collatz stopping time is 110 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 17 × 4483

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 10,008,288

Proper Divisor Sum 6,350,160

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3658117 ← → #3658129

Radix Representation

Decimal	3658128
Binary	1101111101000110010000 (22 bits)
Octal	0o15750620
Hexadecimal	0x37D190

Divisor Catalog (40)

1 2 3 4 6 8 12 16 17 24 34 48 51 68 102 136 204 272 408 816 4,483 8,966 13,449 17,932 26,898 35,864 53,796 71,728 76,211 107,592 152,422 215,184 228,633 304,844 457,266 609,688 914,532 1,219,376 1,829,064 3,658,128

Collatz Trajectory (110 steps to reach 1)

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

3,658,128 1,829,064 914,532 457,266 228,633 685,900 342,950 171,475 514,426 257,213 771,640 385,820 192,910 96,455 289,366 144,683 434,050 217,025 651,076 325,538 162,769 488,308 244,154 122,077 366,232 183,116 91,558 45,779 137,338 68,669 206,008 103,004 51,502 25,751 77,254 38,627 115,882 57,941 173,824 86,912 43,456 21,728 10,864 5,432 2,716 1,358 679 2,038 1,019 3,058 1,529 4,588 2,294 1,147 3,442 1,721 5,164 2,582 1,291 3,874

← Previous Integer #3,658,127 Browse Full Index Next Integer #3,658,129 →