9,724,060

2² × 5 × 486203

9,724,060 factors as 2^2 × 5 × 486203. Its 12 positive divisors give a proper-divisor sum of 10,696,508, so this integer is abundant. The Collatz stopping time is 207 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 486203

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 20,420,568

Proper Divisor Sum 10,696,508

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #9724021 ← → #9724061

Radix Representation

Decimal	9724060
Binary	100101000110000010011100 (24 bits)
Octal	0o45060234
Hexadecimal	0x94609C

Divisor Catalog (12)

1 2 4 5 10 20 486,203 972,406 1,944,812 2,431,015 4,862,030 9,724,060

Collatz Trajectory (207 steps to reach 1)

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

9,724,060 4,862,030 2,431,015 7,293,046 3,646,523 10,939,570 5,469,785 16,409,356 8,204,678 4,102,339 12,307,018 6,153,509 18,460,528 9,230,264 4,615,132 2,307,566 1,153,783 3,461,350 1,730,675 5,192,026 2,596,013 7,788,040 3,894,020 1,947,010 973,505 2,920,516 1,460,258 730,129 2,190,388 1,095,194 547,597 1,642,792 821,396 410,698 205,349 616,048 308,024 154,012 77,006 38,503 115,510 57,755 173,266 86,633 259,900 129,950 64,975 194,926 97,463 292,390 146,195 438,586 219,293 657,880 328,940 164,470 82,235 246,706 123,353 370,060

← Previous Integer #9,724,059 Browse Full Index Next Integer #9,724,061 →