9,727,170

2 × 3 × 5 × 324239

9,727,170 factors as 2 × 3 × 5 × 324239. Its 16 positive divisors give a proper-divisor sum of 13,618,110, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 324239

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 23,345,280

Proper Divisor Sum 13,618,110

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9727169 ← → #9727181

Radix Representation

Decimal	9727170
Binary	100101000110110011000010 (24 bits)
Octal	0o45066302
Hexadecimal	0x946CC2

Divisor Catalog (16)

1 2 3 5 6 10 15 30 324,239 648,478 972,717 1,621,195 1,945,434 3,242,390 4,863,585 9,727,170

Collatz Trajectory (70 steps to reach 1)

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

9,727,170 4,863,585 14,590,756 7,295,378 3,647,689 10,943,068 5,471,534 2,735,767 8,207,302 4,103,651 12,310,954 6,155,477 18,466,432 9,233,216 4,616,608 2,308,304 1,154,152 577,076 288,538 144,269 432,808 216,404 108,202 54,101 162,304 81,152 40,576 20,288 10,144 5,072 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,727,169 Browse Full Index Next Integer #9,727,171 →