3,063,582

2 × 3⁴ × 18911

3,063,582 factors as 2 × 3^4 × 18911. Its 20 positive divisors give a proper-divisor sum of 3,801,474, so this integer is abundant. The Collatz stopping time is 182 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 18911

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 6,865,056

Proper Divisor Sum 3,801,474

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #3063581 ← → #3063583

Radix Representation

Decimal	3063582
Binary	1011101011111100011110 (22 bits)
Octal	0o13537436
Hexadecimal	0x2EBF1E

Divisor Catalog (20)

1 2 3 6 9 18 27 54 81 162 18,911 37,822 56,733 113,466 170,199 340,398 510,597 1,021,194 1,531,791 3,063,582

Collatz Trajectory (182 steps to reach 1)

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

3,063,582 1,531,791 4,595,374 2,297,687 6,893,062 3,446,531 10,339,594 5,169,797 15,509,392 7,754,696 3,877,348 1,938,674 969,337 2,908,012 1,454,006 727,003 2,181,010 1,090,505 3,271,516 1,635,758 817,879 2,453,638 1,226,819 3,680,458 1,840,229 5,520,688 2,760,344 1,380,172 690,086 345,043 1,035,130 517,565 1,552,696 776,348 388,174 194,087 582,262 291,131 873,394 436,697 1,310,092 655,046 327,523 982,570 491,285 1,473,856 736,928 368,464 184,232 92,116 46,058 23,029 69,088 34,544 17,272 8,636 4,318 2,159 6,478 3,239

← Previous Integer #3,063,581 Browse Full Index Next Integer #3,063,583 →