3,389,574

2 × 3 × 79 × 7151

3,389,574 factors as 2 × 3 × 79 × 7151. Its 16 positive divisors give a proper-divisor sum of 3,476,346, so this integer is abundant. The Collatz stopping time is 128 steps.

Prime Factor Structure

Factorization String 2 × 3 × 79 × 7151

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,865,920

Proper Divisor Sum 3,476,346

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3389557 ← → #3389591

Radix Representation

Decimal	3389574
Binary	1100111011100010000110 (22 bits)
Octal	0o14734206
Hexadecimal	0x33B886

Divisor Catalog (16)

1 2 3 6 79 158 237 474 7,151 14,302 21,453 42,906 564,929 1,129,858 1,694,787 3,389,574

Collatz Trajectory (128 steps to reach 1)

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

3,389,574 1,694,787 5,084,362 2,542,181 7,626,544 3,813,272 1,906,636 953,318 476,659 1,429,978 714,989 2,144,968 1,072,484 536,242 268,121 804,364 402,182 201,091 603,274 301,637 904,912 452,456 226,228 113,114 56,557 169,672 84,836 42,418 21,209 63,628 31,814 15,907 47,722 23,861 71,584 35,792 17,896 8,948 4,474 2,237 6,712 3,356 1,678 839 2,518 1,259 3,778 1,889 5,668 2,834 1,417 4,252 2,126 1,063 3,190 1,595 4,786 2,393 7,180 3,590

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,389,573 Browse Full Index Next Integer #3,389,575 →