4,392,872

2³ × 11 × 49919

4,392,872 factors as 2^3 × 11 × 49919. Its 16 positive divisors give a proper-divisor sum of 4,592,728, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 49919

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,985,600

Proper Divisor Sum 4,592,728

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #4392853 ← → #4392881

Radix Representation

Decimal	4392872
Binary	10000110000011110101000 (23 bits)
Octal	0o20603650
Hexadecimal	0x4307A8

Divisor Catalog (16)

1 2 4 8 11 22 44 88 49,919 99,838 199,676 399,352 549,109 1,098,218 2,196,436 4,392,872

Collatz Trajectory (61 steps to reach 1)

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

4,392,872 2,196,436 1,098,218 549,109 1,647,328 823,664 411,832 205,916 102,958 51,479 154,438 77,219 231,658 115,829 347,488 173,744 86,872 43,436 21,718 10,859 32,578 16,289 48,868 24,434 12,217 36,652 18,326 9,163 27,490 13,745 41,236 20,618 10,309 30,928 15,464 7,732 3,866 1,933 5,800 2,900 1,450 725 2,176 1,088 544 272 136 68 34 17 52 26 13 40 20 10 5 16 8 4

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,392,871 Browse Full Index Next Integer #4,392,873 →