4,785,864

2³ × 3 × 199411

4,785,864 factors as 2^3 × 3 × 199411. Its 16 positive divisors give a proper-divisor sum of 7,178,856, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 199411

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 11,964,720

Proper Divisor Sum 7,178,856

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #4785827 ← → #4785881

Radix Representation

Decimal	4785864
Binary	10010010000011011001000 (23 bits)
Octal	0o22203310
Hexadecimal	0x4906C8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 199,411 398,822 598,233 797,644 1,196,466 1,595,288 2,392,932 4,785,864

Collatz Trajectory (100 steps to reach 1)

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

4,785,864 2,392,932 1,196,466 598,233 1,794,700 897,350 448,675 1,346,026 673,013 2,019,040 1,009,520 504,760 252,380 126,190 63,095 189,286 94,643 283,930 141,965 425,896 212,948 106,474 53,237 159,712 79,856 39,928 19,964 9,982 4,991 14,974 7,487 22,462 11,231 33,694 16,847 50,542 25,271 75,814 37,907 113,722 56,861 170,584 85,292 42,646 21,323 63,970 31,985 95,956 47,978 23,989 71,968 35,984 17,992 8,996 4,498 2,249 6,748 3,374 1,687 5,062

← Previous Integer #4,785,863 Browse Full Index Next Integer #4,785,865 →