9,603,450

2 × 3² × 5² × 21341

9,603,450 factors as 2 × 3^2 × 5^2 × 21341. Its 36 positive divisors give a proper-divisor sum of 16,199,028, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5^2 × 21341

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 25,802,478

Proper Divisor Sum 16,199,028

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9603409 ← → #9603457

Radix Representation

Decimal	9603450
Binary	100100101000100101111010 (24 bits)
Octal	0o44504572
Hexadecimal	0x92897A

Divisor Catalog (36)

1 2 3 5 6 9 10 15 18 25 30 45 50 75 90 150 225 450 21,341 42,682 64,023 106,705 128,046 192,069 213,410 320,115 384,138 533,525 640,230 960,345 1,067,050 1,600,575 1,920,690 3,201,150 4,801,725 9,603,450

Collatz Trajectory (150 steps to reach 1)

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

9,603,450 4,801,725 14,405,176 7,202,588 3,601,294 1,800,647 5,401,942 2,700,971 8,102,914 4,051,457 12,154,372 6,077,186 3,038,593 9,115,780 4,557,890 2,278,945 6,836,836 3,418,418 1,709,209 5,127,628 2,563,814 1,281,907 3,845,722 1,922,861 5,768,584 2,884,292 1,442,146 721,073 2,163,220 1,081,610 540,805 1,622,416 811,208 405,604 202,802 101,401 304,204 152,102 76,051 228,154 114,077 342,232 171,116 85,558 42,779 128,338 64,169 192,508 96,254 48,127 144,382 72,191 216,574 108,287 324,862 162,431 487,294 243,647 730,942 365,471

← Previous Integer #9,603,449 Browse Full Index Next Integer #9,603,451 →