3,402,744

2³ × 3 × 29 × 4889

3,402,744 factors as 2^3 × 3 × 29 × 4889. Its 32 positive divisors give a proper-divisor sum of 5,399,256, so this integer is abundant. The Collatz stopping time is 190 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 29 × 4889

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 8,802,000

Proper Divisor Sum 5,399,256

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3402743 ← → #3402787

Radix Representation

Decimal	3402744
Binary	1100111110101111111000 (22 bits)
Octal	0o14765770
Hexadecimal	0x33EBF8

Divisor Catalog (32)

1 2 3 4 6 8 12 24 29 58 87 116 174 232 348 696 4,889 9,778 14,667 19,556 29,334 39,112 58,668 117,336 141,781 283,562 425,343 567,124 850,686 1,134,248 1,701,372 3,402,744

Collatz Trajectory (190 steps to reach 1)

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

3,402,744 1,701,372 850,686 425,343 1,276,030 638,015 1,914,046 957,023 2,871,070 1,435,535 4,306,606 2,153,303 6,459,910 3,229,955 9,689,866 4,844,933 14,534,800 7,267,400 3,633,700 1,816,850 908,425 2,725,276 1,362,638 681,319 2,043,958 1,021,979 3,065,938 1,532,969 4,598,908 2,299,454 1,149,727 3,449,182 1,724,591 5,173,774 2,586,887 7,760,662 3,880,331 11,640,994 5,820,497 17,461,492 8,730,746 4,365,373 13,096,120 6,548,060 3,274,030 1,637,015 4,911,046 2,455,523 7,366,570 3,683,285 11,049,856 5,524,928 2,762,464 1,381,232 690,616 345,308 172,654 86,327 258,982 129,491

← Previous Integer #3,402,743 Browse Full Index Next Integer #3,402,745 →