3,048,558

2 × 3 × 23 × 22091

3,048,558 factors as 2 × 3 × 23 × 22091. Its 16 positive divisors give a proper-divisor sum of 3,313,938, so this integer is abundant. The Collatz stopping time is 195 steps.

Prime Factor Structure

Factorization String 2 × 3 × 23 × 22091

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,362,496

Proper Divisor Sum 3,313,938

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3048557 ← → #3048587

Radix Representation

Decimal	3048558
Binary	1011101000010001101110 (22 bits)
Octal	0o13502156
Hexadecimal	0x2E846E

Divisor Catalog (16)

1 2 3 6 23 46 69 138 22,091 44,182 66,273 132,546 508,093 1,016,186 1,524,279 3,048,558

Collatz Trajectory (195 steps to reach 1)

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

3,048,558 1,524,279 4,572,838 2,286,419 6,859,258 3,429,629 10,288,888 5,144,444 2,572,222 1,286,111 3,858,334 1,929,167 5,787,502 2,893,751 8,681,254 4,340,627 13,021,882 6,510,941 19,532,824 9,766,412 4,883,206 2,441,603 7,324,810 3,662,405 10,987,216 5,493,608 2,746,804 1,373,402 686,701 2,060,104 1,030,052 515,026 257,513 772,540 386,270 193,135 579,406 289,703 869,110 434,555 1,303,666 651,833 1,955,500 977,750 488,875 1,466,626 733,313 2,199,940 1,099,970 549,985 1,649,956 824,978 412,489 1,237,468 618,734 309,367 928,102 464,051 1,392,154 696,077

← Previous Integer #3,048,557 Browse Full Index Next Integer #3,048,559 →