3,338,864

2⁴ × 23 × 43 × 211

3,338,864 factors as 2^4 × 23 × 43 × 211. Its 40 positive divisors give a proper-divisor sum of 3,601,168, so this integer is abundant. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2^4 × 23 × 43 × 211

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 6,940,032

Proper Divisor Sum 3,601,168

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #3338861 ← → #3338873

Radix Representation

Decimal	3338864
Binary	1100101111001001110000 (22 bits)
Octal	0o14571160
Hexadecimal	0x32F270

Divisor Catalog (40)

1 2 4 8 16 23 43 46 86 92 172 184 211 344 368 422 688 844 989 1,688 1,978 3,376 3,956 4,853 7,912 9,073 9,706 15,824 18,146 19,412 36,292 38,824 72,584 77,648 145,168 208,679 417,358 834,716 1,669,432 3,338,864

Collatz Trajectory (89 steps to reach 1)

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

3,338,864 1,669,432 834,716 417,358 208,679 626,038 313,019 939,058 469,529 1,408,588 704,294 352,147 1,056,442 528,221 1,584,664 792,332 396,166 198,083 594,250 297,125 891,376 445,688 222,844 111,422 55,711 167,134 83,567 250,702 125,351 376,054 188,027 564,082 282,041 846,124 423,062 211,531 634,594 317,297 951,892 475,946 237,973 713,920 356,960 178,480 89,240 44,620 22,310 11,155 33,466 16,733 50,200 25,100 12,550 6,275 18,826 9,413 28,240 14,120 7,060 3,530

← Previous Integer #3,338,863 Browse Full Index Next Integer #3,338,865 →