3,051,246

2 × 3 × 11 × 83 × 557

3,051,246 factors as 2 × 3 × 11 × 83 × 557. Its 32 positive divisors give a proper-divisor sum of 3,698,322, so this integer is abundant. The Collatz stopping time is 257 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 83 × 557

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 6,749,568

Proper Divisor Sum 3,698,322

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3051241 ← → #3051253

Radix Representation

Decimal	3051246
Binary	1011101000111011101110 (22 bits)
Octal	0o13507356
Hexadecimal	0x2E8EEE

Divisor Catalog (32)

1 2 3 6 11 22 33 66 83 166 249 498 557 913 1,114 1,671 1,826 2,739 3,342 5,478 6,127 12,254 18,381 36,762 46,231 92,462 138,693 277,386 508,541 1,017,082 1,525,623 3,051,246

Collatz Trajectory (257 steps to reach 1)

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

3,051,246 1,525,623 4,576,870 2,288,435 6,865,306 3,432,653 10,297,960 5,148,980 2,574,490 1,287,245 3,861,736 1,930,868 965,434 482,717 1,448,152 724,076 362,038 181,019 543,058 271,529 814,588 407,294 203,647 610,942 305,471 916,414 458,207 1,374,622 687,311 2,061,934 1,030,967 3,092,902 1,546,451 4,639,354 2,319,677 6,959,032 3,479,516 1,739,758 869,879 2,609,638 1,304,819 3,914,458 1,957,229 5,871,688 2,935,844 1,467,922 733,961 2,201,884 1,100,942 550,471 1,651,414 825,707 2,477,122 1,238,561 3,715,684 1,857,842 928,921 2,786,764 1,393,382 696,691

← Previous Integer #3,051,245 Browse Full Index Next Integer #3,051,247 →