3,111,342

2 × 3 × 13 × 113 × 353

3,111,342 factors as 2 × 3 × 13 × 113 × 353. Its 32 positive divisors give a proper-divisor sum of 3,668,466, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 113 × 353

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 6,779,808

Proper Divisor Sum 3,668,466

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #3111341 ← → #3111343

Radix Representation

Decimal	3111342
Binary	1011110111100110101110 (22 bits)
Octal	0o13674656
Hexadecimal	0x2F79AE

Divisor Catalog (32)

1 2 3 6 13 26 39 78 113 226 339 353 678 706 1,059 1,469 2,118 2,938 4,407 4,589 8,814 9,178 13,767 27,534 39,889 79,778 119,667 239,334 518,557 1,037,114 1,555,671 3,111,342

Collatz Trajectory (164 steps to reach 1)

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

3,111,342 1,555,671 4,667,014 2,333,507 7,000,522 3,500,261 10,500,784 5,250,392 2,625,196 1,312,598 656,299 1,968,898 984,449 2,953,348 1,476,674 738,337 2,215,012 1,107,506 553,753 1,661,260 830,630 415,315 1,245,946 622,973 1,868,920 934,460 467,230 233,615 700,846 350,423 1,051,270 525,635 1,576,906 788,453 2,365,360 1,182,680 591,340 295,670 147,835 443,506 221,753 665,260 332,630 166,315 498,946 249,473 748,420 374,210 187,105 561,316 280,658 140,329 420,988 210,494 105,247 315,742 157,871 473,614 236,807 710,422

← Previous Integer #3,111,341 Browse Full Index Next Integer #3,111,343 →