4,852,250

2 × 5³ × 13 × 1493

4,852,250 factors as 2 × 5^3 × 13 × 1493. Its 32 positive divisors give a proper-divisor sum of 4,936,438, so this integer is abundant. The Collatz stopping time is 206 steps.

Prime Factor Structure

Factorization String 2 × 5^3 × 13 × 1493

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,788,688

Proper Divisor Sum 4,936,438

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #4852247 ← → #4852261

Radix Representation

Decimal	4852250
Binary	10010100000101000011010 (23 bits)
Octal	0o22405032
Hexadecimal	0x4A0A1A

Divisor Catalog (32)

Collatz Trajectory (206 steps to reach 1)

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

4,852,250 2,426,125 7,278,376 3,639,188 1,819,594 909,797 2,729,392 1,364,696 682,348 341,174 170,587 511,762 255,881 767,644 383,822 191,911 575,734 287,867 863,602 431,801 1,295,404 647,702 323,851 971,554 485,777 1,457,332 728,666 364,333 1,093,000 546,500 273,250 136,625 409,876 204,938 102,469 307,408 153,704 76,852 38,426 19,213 57,640 28,820 14,410 7,205 21,616 10,808 5,404 2,702 1,351 4,054 2,027 6,082 3,041 9,124 4,562 2,281 6,844 3,422 1,711 5,134

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,852,249 Browse Full Index Next Integer #4,852,251 →