3,400,974

2 × 3³ × 62981

3,400,974 factors as 2 × 3^3 × 62981. Its 16 positive divisors give a proper-divisor sum of 4,156,866, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 62981

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,557,840

Proper Divisor Sum 4,156,866

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #3400963 ← → #3400993

Radix Representation

Decimal	3400974
Binary	1100111110010100001110 (22 bits)
Octal	0o14762416
Hexadecimal	0x33E50E

Divisor Catalog (16)

1 2 3 6 9 18 27 54 62,981 125,962 188,943 377,886 566,829 1,133,658 1,700,487 3,400,974

Collatz Trajectory (84 steps to reach 1)

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

3,400,974 1,700,487 5,101,462 2,550,731 7,652,194 3,826,097 11,478,292 5,739,146 2,869,573 8,608,720 4,304,360 2,152,180 1,076,090 538,045 1,614,136 807,068 403,534 201,767 605,302 302,651 907,954 453,977 1,361,932 680,966 340,483 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 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,400,973 Browse Full Index Next Integer #3,400,975 →