9,365,540

2² × 5 × 468277

9,365,540 factors as 2^2 × 5 × 468277. Its 12 positive divisors give a proper-divisor sum of 10,302,136, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 468277

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 19,667,676

Proper Divisor Sum 10,302,136

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #9365533 ← → #9365557

Radix Representation

Decimal	9365540
Binary	100011101110100000100100 (24 bits)
Octal	0o43564044
Hexadecimal	0x8EE824

Divisor Catalog (12)

1 2 4 5 10 20 468,277 936,554 1,873,108 2,341,385 4,682,770 9,365,540

Collatz Trajectory (132 steps to reach 1)

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

9,365,540 4,682,770 2,341,385 7,024,156 3,512,078 1,756,039 5,268,118 2,634,059 7,902,178 3,951,089 11,853,268 5,926,634 2,963,317 8,889,952 4,444,976 2,222,488 1,111,244 555,622 277,811 833,434 416,717 1,250,152 625,076 312,538 156,269 468,808 234,404 117,202 58,601 175,804 87,902 43,951 131,854 65,927 197,782 98,891 296,674 148,337 445,012 222,506 111,253 333,760 166,880 83,440 41,720 20,860 10,430 5,215 15,646 7,823 23,470 11,735 35,206 17,603 52,810 26,405 79,216 39,608 19,804 9,902

← Previous Integer #9,365,539 Browse Full Index Next Integer #9,365,541 →