4,885,710

2 × 3 × 5 × 149 × 1093

4,885,710 factors as 2 × 3 × 5 × 149 × 1093. Its 32 positive divisors give a proper-divisor sum of 6,929,490, so this integer is abundant. The Collatz stopping time is 206 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 149 × 1093

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 11,815,200

Proper Divisor Sum 6,929,490

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4885691 ← → #4885753

Radix Representation

Decimal	4885710
Binary	10010101000110011001110 (23 bits)
Octal	0o22506316
Hexadecimal	0x4A8CCE

Divisor Catalog (32)

1 2 3 5 6 10 15 30 149 298 447 745 894 1,093 1,490 2,186 2,235 3,279 4,470 5,465 6,558 10,930 16,395 32,790 162,857 325,714 488,571 814,285 977,142 1,628,570 2,442,855 4,885,710

Collatz Trajectory (206 steps to reach 1)

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

4,885,710 2,442,855 7,328,566 3,664,283 10,992,850 5,496,425 16,489,276 8,244,638 4,122,319 12,366,958 6,183,479 18,550,438 9,275,219 27,825,658 13,912,829 41,738,488 20,869,244 10,434,622 5,217,311 15,651,934 7,825,967 23,477,902 11,738,951 35,216,854 17,608,427 52,825,282 26,412,641 79,237,924 39,618,962 19,809,481 59,428,444 29,714,222 14,857,111 44,571,334 22,285,667 66,857,002 33,428,501 100,285,504 50,142,752 25,071,376 12,535,688 6,267,844 3,133,922 1,566,961 4,700,884 2,350,442 1,175,221 3,525,664 1,762,832 881,416 440,708 220,354 110,177 330,532 165,266 82,633 247,900 123,950 61,975 185,926

← Previous Integer #4,885,709 Browse Full Index Next Integer #4,885,711 →