3,333,948

2² × 3 × 277829

3,333,948 factors as 2^2 × 3 × 277829. Its 12 positive divisors give a proper-divisor sum of 4,445,292, so this integer is abundant. The Collatz stopping time is 115 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 277829

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,779,240

Proper Divisor Sum 4,445,292

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3333943 ← → #3333961

Radix Representation

Decimal	3333948
Binary	1100101101111100111100 (22 bits)
Octal	0o14557474
Hexadecimal	0x32DF3C

Divisor Catalog (12)

1 2 3 4 6 12 277,829 555,658 833,487 1,111,316 1,666,974 3,333,948

Collatz Trajectory (115 steps to reach 1)

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

3,333,948 1,666,974 833,487 2,500,462 1,250,231 3,750,694 1,875,347 5,626,042 2,813,021 8,439,064 4,219,532 2,109,766 1,054,883 3,164,650 1,582,325 4,746,976 2,373,488 1,186,744 593,372 296,686 148,343 445,030 222,515 667,546 333,773 1,001,320 500,660 250,330 125,165 375,496 187,748 93,874 46,937 140,812 70,406 35,203 105,610 52,805 158,416 79,208 39,604 19,802 9,901 29,704 14,852 7,426 3,713 11,140 5,570 2,785 8,356 4,178 2,089 6,268 3,134 1,567 4,702 2,351 7,054 3,527

← Previous Integer #3,333,947 Browse Full Index Next Integer #3,333,949 →