9,361,620

2² × 3² × 5 × 52009

9,361,620 factors as 2^2 × 3^2 × 5 × 52009. Its 36 positive divisors give a proper-divisor sum of 19,035,840, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 5 × 52009

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 28,397,460

Proper Divisor Sum 19,035,840

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9361619 ← → #9361631

Radix Representation

Decimal	9361620
Binary	100011101101100011010100 (24 bits)
Octal	0o43554324
Hexadecimal	0x8ED8D4

Divisor Catalog (36)

1 2 3 4 5 6 9 10 12 15 18 20 30 36 45 60 90 180 52,009 104,018 156,027 208,036 260,045 312,054 468,081 520,090 624,108 780,135 936,162 1,040,180 1,560,270 1,872,324 2,340,405 3,120,540 4,680,810 9,361,620

Collatz Trajectory (70 steps to reach 1)

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

9,361,620 4,680,810 2,340,405 7,021,216 3,510,608 1,755,304 877,652 438,826 219,413 658,240 329,120 164,560 82,280 41,140 20,570 10,285 30,856 15,428 7,714 3,857 11,572 5,786 2,893 8,680 4,340 2,170 1,085 3,256 1,628 814 407 1,222 611 1,834 917 2,752 1,376 688 344 172 86 43 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52

← Previous Integer #9,361,619 Browse Full Index Next Integer #9,361,621 →