50,009,250

2 × 3 × 5³ × 131 × 509

50,009,250 factors as 2 × 3 × 5^3 × 131 × 509. Its 64 positive divisors give a proper-divisor sum of 76,013,790, so this integer is abundant. The Collatz stopping time is 323 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^3 × 131 × 509

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 126,023,040

Proper Divisor Sum 76,013,790

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #50009233 ← → #50009251

Radix Representation

Decimal	50009250
Binary	10111110110001010010100010 (26 bits)
Octal	0o276612242
Hexadecimal	0x2FB14A2

Divisor Catalog (60 of 64)

1 2 3 5 6 10 15 25 30 50 75 125 131 150 250 262 375 393 509 655 750 786 1,018 1,310 1,527 1,965 2,545 3,054 3,275 3,930 5,090 6,550 7,635 9,825 12,725 15,270 16,375 19,650 25,450 32,750 38,175 49,125 63,625 66,679 76,350 98,250 127,250 133,358 190,875 200,037 333,395 381,750 400,074 666,790 1,000,185 1,666,975 2,000,370 3,333,950 5,000,925 8,334,875

Collatz Trajectory (323 steps to reach 1)

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

50,009,250 25,004,625 75,013,876 37,506,938 18,753,469 56,260,408 28,130,204 14,065,102 7,032,551 21,097,654 10,548,827 31,646,482 15,823,241 47,469,724 23,734,862 11,867,431 35,602,294 17,801,147 53,403,442 26,701,721 80,105,164 40,052,582 20,026,291 60,078,874 30,039,437 90,118,312 45,059,156 22,529,578 11,264,789 33,794,368 16,897,184 8,448,592 4,224,296 2,112,148 1,056,074 528,037 1,584,112 792,056 396,028 198,014 99,007 297,022 148,511 445,534 222,767 668,302 334,151 1,002,454 501,227 1,503,682 751,841 2,255,524 1,127,762 563,881 1,691,644 845,822 422,911 1,268,734 634,367 1,903,102

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #50,009,249 Browse Full Index Next Integer #50,009,251 →