3,427,854

2 × 3 × 67 × 8527

3,427,854 factors as 2 × 3 × 67 × 8527. Its 16 positive divisors give a proper-divisor sum of 3,530,994, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2 × 3 × 67 × 8527

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,958,848

Proper Divisor Sum 3,530,994

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3427849 ← → #3427859

Radix Representation

Decimal	3427854
Binary	1101000100111000001110 (22 bits)
Octal	0o15047016
Hexadecimal	0x344E0E

Divisor Catalog (16)

1 2 3 6 67 134 201 402 8,527 17,054 25,581 51,162 571,309 1,142,618 1,713,927 3,427,854

Collatz Trajectory (84 steps to reach 1)

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

3,427,854 1,713,927 5,141,782 2,570,891 7,712,674 3,856,337 11,569,012 5,784,506 2,892,253 8,676,760 4,338,380 2,169,190 1,084,595 3,253,786 1,626,893 4,880,680 2,440,340 1,220,170 610,085 1,830,256 915,128 457,564 228,782 114,391 343,174 171,587 514,762 257,381 772,144 386,072 193,036 96,518 48,259 144,778 72,389 217,168 108,584 54,292 27,146 13,573 40,720 20,360 10,180 5,090 2,545 7,636 3,818 1,909 5,728 2,864 1,432 716 358 179 538 269 808 404 202 101

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,427,853 Browse Full Index Next Integer #3,427,855 →