9,746,370

2 × 3² × 5 × 108293

9,746,370 factors as 2 × 3^2 × 5 × 108293. Its 24 positive divisors give a proper-divisor sum of 15,594,426, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 108293

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 25,340,796

Proper Divisor Sum 15,594,426

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9746353 ← → #9746381

Radix Representation

Decimal	9746370
Binary	100101001011011111000010 (24 bits)
Octal	0o45133702
Hexadecimal	0x94B7C2

Divisor Catalog (24)

1 2 3 5 6 9 10 15 18 30 45 90 108,293 216,586 324,879 541,465 649,758 974,637 1,082,930 1,624,395 1,949,274 3,248,790 4,873,185 9,746,370

Collatz Trajectory (150 steps to reach 1)

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

9,746,370 4,873,185 14,619,556 7,309,778 3,654,889 10,964,668 5,482,334 2,741,167 8,223,502 4,111,751 12,335,254 6,167,627 18,502,882 9,251,441 27,754,324 13,877,162 6,938,581 20,815,744 10,407,872 5,203,936 2,601,968 1,300,984 650,492 325,246 162,623 487,870 243,935 731,806 365,903 1,097,710 548,855 1,646,566 823,283 2,469,850 1,234,925 3,704,776 1,852,388 926,194 463,097 1,389,292 694,646 347,323 1,041,970 520,985 1,562,956 781,478 390,739 1,172,218 586,109 1,758,328 879,164 439,582 219,791 659,374 329,687 989,062 494,531 1,483,594 741,797 2,225,392

← Previous Integer #9,746,369 Browse Full Index Next Integer #9,746,371 →