4,956,657

3 × 1181 × 1399

4,956,657 factors as 3 × 1181 × 1399. Its 8 positive divisors give a proper-divisor sum of 1,662,543, so this integer is deficient. The Collatz stopping time is 82 steps.

Prime Factor Structure

Factorization String 3 × 1181 × 1399

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,619,200

Proper Divisor Sum 1,662,543

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #4956643 ← → #4956691

Radix Representation

Decimal	4956657
Binary	10010111010000111110001 (23 bits)
Octal	0o22720761
Hexadecimal	0x4BA1F1

Divisor Catalog (8)

1 3 1,181 1,399 3,543 4,197 1,652,219 4,956,657

Collatz Trajectory (82 steps to reach 1)

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

4,956,657 14,869,972 7,434,986 3,717,493 11,152,480 5,576,240 2,788,120 1,394,060 697,030 348,515 1,045,546 522,773 1,568,320 784,160 392,080 196,040 98,020 49,010 24,505 73,516 36,758 18,379 55,138 27,569 82,708 41,354 20,677 62,032 31,016 15,508 7,754 3,877 11,632 5,816 2,908 1,454 727 2,182 1,091 3,274 1,637 4,912 2,456 1,228 614 307 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148

← Previous Integer #4,956,656 Browse Full Index Next Integer #4,956,658 →