4,907,100

2² × 3 × 5² × 11 × 1487

4,907,100 factors as 2^2 × 3 × 5^2 × 11 × 1487. Its 72 positive divisors give a proper-divisor sum of 10,591,908, so this integer is abundant. The Collatz stopping time is 43 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5^2 × 11 × 1487

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 15,499,008

Proper Divisor Sum 10,591,908

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #4907099 ← → #4907107

Radix Representation

Decimal	4907100
Binary	10010101110000001011100 (23 bits)
Octal	0o22560134
Hexadecimal	0x4AE05C

Divisor Catalog (60 of 72)

1 2 3 4 5 6 10 11 12 15 20 22 25 30 33 44 50 55 60 66 75 100 110 132 150 165 220 275 300 330 550 660 825 1,100 1,487 1,650 2,974 3,300 4,461 5,948 7,435 8,922 14,870 16,357 17,844 22,305 29,740 32,714 37,175 44,610 49,071 65,428 74,350 81,785 89,220 98,142 111,525 148,700 163,570 196,284

Collatz Trajectory (43 steps to reach 1)

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

4,907,100 2,453,550 1,226,775 3,680,326 1,840,163 5,520,490 2,760,245 8,280,736 4,140,368 2,070,184 1,035,092 517,546 258,773 776,320 388,160 194,080 97,040 48,520 24,260 12,130 6,065 18,196 9,098 4,549 13,648 6,824 3,412 1,706 853 2,560 1,280 640 320 160 80 40 20 10 5 16 8 4 2 1

← Previous Integer #4,907,099 Browse Full Index Next Integer #4,907,101 →