3,397,494

2 × 3 × 463 × 1223

3,397,494 factors as 2 × 3 × 463 × 1223. Its 16 positive divisors give a proper-divisor sum of 3,417,738, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2 × 3 × 463 × 1223

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,815,232

Proper Divisor Sum 3,417,738

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3397487 ← → #3397519

Radix Representation

Decimal	3397494
Binary	1100111101011101110110 (22 bits)
Octal	0o14753566
Hexadecimal	0x33D776

Divisor Catalog (16)

1 2 3 6 463 926 1,223 1,389 2,446 2,778 3,669 7,338 566,249 1,132,498 1,698,747 3,397,494

Collatz Trajectory (84 steps to reach 1)

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

3,397,494 1,698,747 5,096,242 2,548,121 7,644,364 3,822,182 1,911,091 5,733,274 2,866,637 8,599,912 4,299,956 2,149,978 1,074,989 3,224,968 1,612,484 806,242 403,121 1,209,364 604,682 302,341 907,024 453,512 226,756 113,378 56,689 170,068 85,034 42,517 127,552 63,776 31,888 15,944 7,972 3,986 1,993 5,980 2,990 1,495 4,486 2,243 6,730 3,365 10,096 5,048 2,524 1,262 631 1,894 947 2,842 1,421 4,264 2,132 1,066 533 1,600 800 400 200 100

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,397,493 Browse Full Index Next Integer #3,397,495 →