9,715,500

2² × 3² × 5³ × 17 × 127

9,715,500 factors as 2^2 × 3^2 × 5^3 × 17 × 127. Its 144 positive divisors give a proper-divisor sum of 22,992,084, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 5^3 × 17 × 127

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 144

Divisor Sum (σ) 32,707,584

Proper Divisor Sum 22,992,084

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9715487 ← → #9715501

Radix Representation

Decimal	9715500
Binary	100101000011111100101100 (24 bits)
Octal	0o45037454
Hexadecimal	0x943F2C

Divisor Catalog (60 of 144)

1 2 3 4 5 6 9 10 12 15 17 18 20 25 30 34 36 45 50 51 60 68 75 85 90 100 102 125 127 150 153 170 180 204 225 250 254 255 300 306 340 375 381 425 450 500 508 510 612 635 750 762 765 850 900 1,020 1,125 1,143 1,270 1,275

Collatz Trajectory (70 steps to reach 1)

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

9,715,500 4,857,750 2,428,875 7,286,626 3,643,313 10,929,940 5,464,970 2,732,485 8,197,456 4,098,728 2,049,364 1,024,682 512,341 1,537,024 768,512 384,256 192,128 96,064 48,032 24,016 12,008 6,004 3,002 1,501 4,504 2,252 1,126 563 1,690 845 2,536 1,268 634 317 952 476 238 119 358 179 538 269 808 404 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,715,499 Browse Full Index Next Integer #9,715,501 →