3,857,250

2 × 3 × 5³ × 37 × 139

3,857,250 factors as 2 × 3 × 5^3 × 37 × 139. Its 64 positive divisors give a proper-divisor sum of 6,101,790, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^3 × 37 × 139

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 9,959,040

Proper Divisor Sum 6,101,790

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3857233 ← → #3857263

Radix Representation

Decimal	3857250
Binary	1110101101101101100010 (22 bits)
Octal	0o16555542
Hexadecimal	0x3ADB62

Divisor Catalog (60 of 64)

1 2 3 5 6 10 15 25 30 37 50 74 75 111 125 139 150 185 222 250 278 370 375 417 555 695 750 834 925 1,110 1,390 1,850 2,085 2,775 3,475 4,170 4,625 5,143 5,550 6,950 9,250 10,286 10,425 13,875 15,429 17,375 20,850 25,715 27,750 30,858 34,750 51,430 52,125 77,145 104,250 128,575 154,290 257,150 385,725 642,875

Collatz Trajectory (185 steps to reach 1)

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

3,857,250 1,928,625 5,785,876 2,892,938 1,446,469 4,339,408 2,169,704 1,084,852 542,426 271,213 813,640 406,820 203,410 101,705 305,116 152,558 76,279 228,838 114,419 343,258 171,629 514,888 257,444 128,722 64,361 193,084 96,542 48,271 144,814 72,407 217,222 108,611 325,834 162,917 488,752 244,376 122,188 61,094 30,547 91,642 45,821 137,464 68,732 34,366 17,183 51,550 25,775 77,326 38,663 115,990 57,995 173,986 86,993 260,980 130,490 65,245 195,736 97,868 48,934 24,467

← Previous Integer #3,857,249 Browse Full Index Next Integer #3,857,251 →