4,755,560

2³ × 5 × 61 × 1949

4,755,560 factors as 2^3 × 5 × 61 × 1949. Its 32 positive divisors give a proper-divisor sum of 6,125,440, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 61 × 1949

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 10,881,000

Proper Divisor Sum 6,125,440

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #4755559 ← → #4755571

Radix Representation

Decimal	4755560
Binary	10010001001000001101000 (23 bits)
Octal	0o22110150
Hexadecimal	0x489068

Divisor Catalog (32)

1 2 4 5 8 10 20 40 61 122 244 305 488 610 1,220 1,949 2,440 3,898 7,796 9,745 15,592 19,490 38,980 77,960 118,889 237,778 475,556 594,445 951,112 1,188,890 2,377,780 4,755,560

Collatz Trajectory (100 steps to reach 1)

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

4,755,560 2,377,780 1,188,890 594,445 1,783,336 891,668 445,834 222,917 668,752 334,376 167,188 83,594 41,797 125,392 62,696 31,348 15,674 7,837 23,512 11,756 5,878 2,939 8,818 4,409 13,228 6,614 3,307 9,922 4,961 14,884 7,442 3,721 11,164 5,582 2,791 8,374 4,187 12,562 6,281 18,844 9,422 4,711 14,134 7,067 21,202 10,601 31,804 15,902 7,951 23,854 11,927 35,782 17,891 53,674 26,837 80,512 40,256 20,128 10,064 5,032

← Previous Integer #4,755,559 Browse Full Index Next Integer #4,755,561 →