4,967,778

2 × 3 × 19 × 43577

4,967,778 factors as 2 × 3 × 19 × 43577. Its 16 positive divisors give a proper-divisor sum of 5,490,942, so this integer is abundant. The Collatz stopping time is 82 steps.

Prime Factor Structure

Factorization String 2 × 3 × 19 × 43577

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,458,720

Proper Divisor Sum 5,490,942

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #4967777 ← → #4967783

Radix Representation

Decimal	4967778
Binary	10010111100110101100010 (23 bits)
Octal	0o22746542
Hexadecimal	0x4BCD62

Divisor Catalog (16)

1 2 3 6 19 38 57 114 43,577 87,154 130,731 261,462 827,963 1,655,926 2,483,889 4,967,778

Collatz Trajectory (82 steps to reach 1)

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

4,967,778 2,483,889 7,451,668 3,725,834 1,862,917 5,588,752 2,794,376 1,397,188 698,594 349,297 1,047,892 523,946 261,973 785,920 392,960 196,480 98,240 49,120 24,560 12,280 6,140 3,070 1,535 4,606 2,303 6,910 3,455 10,366 5,183 15,550 7,775 23,326 11,663 34,990 17,495 52,486 26,243 78,730 39,365 118,096 59,048 29,524 14,762 7,381 22,144 11,072 5,536 2,768 1,384 692 346 173 520 260 130 65 196 98 49 148

← Previous Integer #4,967,777 Browse Full Index Next Integer #4,967,779 →