3,413,346

2 × 3 × 568891

3,413,346 factors as 2 × 3 × 568891. Its 8 positive divisors give a proper-divisor sum of 3,413,358, so this integer is abundant. The Collatz stopping time is 76 steps.

Prime Factor Structure

Factorization String 2 × 3 × 568891

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,826,704

Proper Divisor Sum 3,413,358

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3413321 ← → #3413357

Radix Representation

Decimal	3413346
Binary	1101000001010101100010 (22 bits)
Octal	0o15012542
Hexadecimal	0x341562

Divisor Catalog (8)

1 2 3 6 568,891 1,137,782 1,706,673 3,413,346

Collatz Trajectory (76 steps to reach 1)

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

3,413,346 1,706,673 5,120,020 2,560,010 1,280,005 3,840,016 1,920,008 960,004 480,002 240,001 720,004 360,002 180,001 540,004 270,002 135,001 405,004 202,502 101,251 303,754 151,877 455,632 227,816 113,908 56,954 28,477 85,432 42,716 21,358 10,679 32,038 16,019 48,058 24,029 72,088 36,044 18,022 9,011 27,034 13,517 40,552 20,276 10,138 5,069 15,208 7,604 3,802 1,901 5,704 2,852 1,426 713 2,140 1,070 535 1,606 803 2,410 1,205 3,616

← Previous Integer #3,413,345 Browse Full Index Next Integer #3,413,347 →