9,507,550

2 × 5² × 13 × 14627

9,507,550 factors as 2 × 5^2 × 13 × 14627. Its 24 positive divisors give a proper-divisor sum of 9,538,106, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2 × 5^2 × 13 × 14627

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 19,045,656

Proper Divisor Sum 9,538,106

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #9507527 ← → #9507551

Radix Representation

Decimal	9507550
Binary	100100010001001011011110 (24 bits)
Octal	0o44211336
Hexadecimal	0x9112DE

Divisor Catalog (24)

Collatz Trajectory (150 steps to reach 1)

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

9,507,550 4,753,775 14,261,326 7,130,663 21,391,990 10,695,995 32,087,986 16,043,993 48,131,980 24,065,990 12,032,995 36,098,986 18,049,493 54,148,480 27,074,240 13,537,120 6,768,560 3,384,280 1,692,140 846,070 423,035 1,269,106 634,553 1,903,660 951,830 475,915 1,427,746 713,873 2,141,620 1,070,810 535,405 1,606,216 803,108 401,554 200,777 602,332 301,166 150,583 451,750 225,875 677,626 338,813 1,016,440 508,220 254,110 127,055 381,166 190,583 571,750 285,875 857,626 428,813 1,286,440 643,220 321,610 160,805 482,416 241,208 120,604 60,302

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,507,549 Browse Full Index Next Integer #9,507,551 →