3,274,842

2 × 3 × 107 × 5101

3,274,842 factors as 2 × 3 × 107 × 5101. Its 16 positive divisors give a proper-divisor sum of 3,337,350, so this integer is abundant. The Collatz stopping time is 71 steps.

Prime Factor Structure

Factorization String 2 × 3 × 107 × 5101

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,612,192

Proper Divisor Sum 3,337,350

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3274841 ← → #3274847

Radix Representation

Decimal	3274842
Binary	1100011111100001011010 (22 bits)
Octal	0o14374132
Hexadecimal	0x31F85A

Divisor Catalog (16)

1 2 3 6 107 214 321 642 5,101 10,202 15,303 30,606 545,807 1,091,614 1,637,421 3,274,842

Collatz Trajectory (71 steps to reach 1)

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

3,274,842 1,637,421 4,912,264 2,456,132 1,228,066 614,033 1,842,100 921,050 460,525 1,381,576 690,788 345,394 172,697 518,092 259,046 129,523 388,570 194,285 582,856 291,428 145,714 72,857 218,572 109,286 54,643 163,930 81,965 245,896 122,948 61,474 30,737 92,212 46,106 23,053 69,160 34,580 17,290 8,645 25,936 12,968 6,484 3,242 1,621 4,864 2,432 1,216 608 304 152 76 38 19 58 29 88 44 22 11 34 17

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,274,841 Browse Full Index Next Integer #3,274,843 →