4,968,028

2² × 13 × 95539

4,968,028 factors as 2^2 × 13 × 95539. Its 12 positive divisors give a proper-divisor sum of 4,394,892, so this integer is deficient. The Collatz stopping time is 82 steps.

Prime Factor Structure

Factorization String 2^2 × 13 × 95539

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,362,920

Proper Divisor Sum 4,394,892

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #4968017 ← → #4968037

Radix Representation

Decimal	4968028
Binary	10010111100111001011100 (23 bits)
Octal	0o22747134
Hexadecimal	0x4BCE5C

Divisor Catalog (12)

1 2 4 13 26 52 95,539 191,078 382,156 1,242,007 2,484,014 4,968,028

Collatz Trajectory (82 steps to reach 1)

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

4,968,028 2,484,014 1,242,007 3,726,022 1,863,011 5,589,034 2,794,517 8,383,552 4,191,776 2,095,888 1,047,944 523,972 261,986 130,993 392,980 196,490 98,245 294,736 147,368 73,684 36,842 18,421 55,264 27,632 13,816 6,908 3,454 1,727 5,182 2,591 7,774 3,887 11,662 5,831 17,494 8,747 26,242 13,121 39,364 19,682 9,841 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,968,027 Browse Full Index Next Integer #4,968,029 →