3,440,010

2 × 3 × 5 × 7 × 16381

3,440,010 factors as 2 × 3 × 5 × 7 × 16381. Its 32 positive divisors give a proper-divisor sum of 5,996,022, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 7 × 16381

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,436,032

Proper Divisor Sum 5,996,022

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #3439999 ← → #3440011

Radix Representation

Decimal	3440010
Binary	1101000111110110001010 (22 bits)
Octal	0o15076612
Hexadecimal	0x347D8A

Divisor Catalog (32)

1 2 3 5 6 7 10 14 15 21 30 35 42 70 105 210 16,381 32,762 49,143 81,905 98,286 114,667 163,810 229,334 245,715 344,001 491,430 573,335 688,002 1,146,670 1,720,005 3,440,010

Collatz Trajectory (97 steps to reach 1)

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

3,440,010 1,720,005 5,160,016 2,580,008 1,290,004 645,002 322,501 967,504 483,752 241,876 120,938 60,469 181,408 90,704 45,352 22,676 11,338 5,669 17,008 8,504 4,252 2,126 1,063 3,190 1,595 4,786 2,393 7,180 3,590 1,795 5,386 2,693 8,080 4,040 2,020 1,010 505 1,516 758 379 1,138 569 1,708 854 427 1,282 641 1,924 962 481 1,444 722 361 1,084 542 271 814 407 1,222 611

← Previous Integer #3,440,009 Browse Full Index Next Integer #3,440,011 →