4,837,100

2² × 5² × 48371

4,837,100 factors as 2^2 × 5^2 × 48371. Its 18 positive divisors give a proper-divisor sum of 5,659,624, so this integer is abundant. The Collatz stopping time is 193 steps.

Prime Factor Structure

Factorization String 2^2 × 5^2 × 48371

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 10,496,724

Proper Divisor Sum 5,659,624

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #4837087 ← → #4837141

Radix Representation

Decimal	4837100
Binary	10010011100111011101100 (23 bits)
Octal	0o22347354
Hexadecimal	0x49CEEC

Divisor Catalog (18)

1 2 4 5 10 20 25 50 100 48,371 96,742 193,484 241,855 483,710 967,420 1,209,275 2,418,550 4,837,100

Collatz Trajectory (193 steps to reach 1)

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

4,837,100 2,418,550 1,209,275 3,627,826 1,813,913 5,441,740 2,720,870 1,360,435 4,081,306 2,040,653 6,121,960 3,060,980 1,530,490 765,245 2,295,736 1,147,868 573,934 286,967 860,902 430,451 1,291,354 645,677 1,937,032 968,516 484,258 242,129 726,388 363,194 181,597 544,792 272,396 136,198 68,099 204,298 102,149 306,448 153,224 76,612 38,306 19,153 57,460 28,730 14,365 43,096 21,548 10,774 5,387 16,162 8,081 24,244 12,122 6,061 18,184 9,092 4,546 2,273 6,820 3,410 1,705 5,116

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