4,779,000

2³ × 3⁴ × 5³ × 59

4,779,000 factors as 2^3 × 3^4 × 5^3 × 59. Its 160 positive divisors give a proper-divisor sum of 12,209,400, so this integer is abundant. The Collatz stopping time is 144 steps.

Prime Factor Structure

Factorization String 2^3 × 3^4 × 5^3 × 59

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 160

Divisor Sum (σ) 16,988,400

Proper Divisor Sum 12,209,400

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4778993 ← → #4779029

Radix Representation

Decimal	4779000
Binary	10010001110101111111000 (23 bits)
Octal	0o22165770
Hexadecimal	0x48EBF8

Divisor Catalog (60 of 160)

1 2 3 4 5 6 8 9 10 12 15 18 20 24 25 27 30 36 40 45 50 54 59 60 72 75 81 90 100 108 118 120 125 135 150 162 177 180 200 216 225 236 250 270 295 300 324 354 360 375 405 450 472 500 531 540 590 600 648 675

Collatz Trajectory (144 steps to reach 1)

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

4,779,000 2,389,500 1,194,750 597,375 1,792,126 896,063 2,688,190 1,344,095 4,032,286 2,016,143 6,048,430 3,024,215 9,072,646 4,536,323 13,608,970 6,804,485 20,413,456 10,206,728 5,103,364 2,551,682 1,275,841 3,827,524 1,913,762 956,881 2,870,644 1,435,322 717,661 2,152,984 1,076,492 538,246 269,123 807,370 403,685 1,211,056 605,528 302,764 151,382 75,691 227,074 113,537 340,612 170,306 85,153 255,460 127,730 63,865 191,596 95,798 47,899 143,698 71,849 215,548 107,774 53,887 161,662 80,831 242,494 121,247 363,742 181,871

← Previous Integer #4,778,999 Browse Full Index Next Integer #4,779,001 →