3,023,094

2 × 3 × 41 × 12289

3,023,094 factors as 2 × 3 × 41 × 12289. Its 16 positive divisors give a proper-divisor sum of 3,171,066, so this integer is abundant. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2 × 3 × 41 × 12289

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,194,160

Proper Divisor Sum 3,171,066

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3023081 ← → #3023113

Radix Representation

Decimal	3023094
Binary	1011100010000011110110 (22 bits)
Octal	0o13420366
Hexadecimal	0x2E20F6

Divisor Catalog (16)

1 2 3 6 41 82 123 246 12,289 24,578 36,867 73,734 503,849 1,007,698 1,511,547 3,023,094

Collatz Trajectory (89 steps to reach 1)

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

3,023,094 1,511,547 4,534,642 2,267,321 6,801,964 3,400,982 1,700,491 5,101,474 2,550,737 7,652,212 3,826,106 1,913,053 5,739,160 2,869,580 1,434,790 717,395 2,152,186 1,076,093 3,228,280 1,614,140 807,070 403,535 1,210,606 605,303 1,815,910 907,955 2,723,866 1,361,933 4,085,800 2,042,900 1,021,450 510,725 1,532,176 766,088 383,044 191,522 95,761 287,284 143,642 71,821 215,464 107,732 53,866 26,933 80,800 40,400 20,200 10,100 5,050 2,525 7,576 3,788 1,894 947 2,842 1,421 4,264 2,132 1,066 533

← Previous Integer #3,023,093 Browse Full Index Next Integer #3,023,095 →