3,848,874

2 × 3 × 641479

3,848,874 factors as 2 × 3 × 641479. Its 8 positive divisors give a proper-divisor sum of 3,848,886, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2 × 3 × 641479

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,697,760

Proper Divisor Sum 3,848,886

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #3848869 ← → #3848881

Radix Representation

Decimal	3848874
Binary	1110101011101010101010 (22 bits)
Octal	0o16535252
Hexadecimal	0x3ABAAA

Divisor Catalog (8)

1 2 3 6 641,479 1,282,958 1,924,437 3,848,874

Collatz Trajectory (97 steps to reach 1)

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

3,848,874 1,924,437 5,773,312 2,886,656 1,443,328 721,664 360,832 180,416 90,208 45,104 22,552 11,276 5,638 2,819 8,458 4,229 12,688 6,344 3,172 1,586 793 2,380 1,190 595 1,786 893 2,680 1,340 670 335 1,006 503 1,510 755 2,266 1,133 3,400 1,700 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079 3,238 1,619 4,858 2,429 7,288 3,644 1,822 911 2,734 1,367 4,102

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,848,873 Browse Full Index Next Integer #3,848,875 →