9,460,720

2⁴ × 5 × 118259

9,460,720 factors as 2^4 × 5 × 118259. Its 20 positive divisors give a proper-divisor sum of 12,535,640, so this integer is abundant. The Collatz stopping time is 124 steps.

Prime Factor Structure

Factorization String 2^4 × 5 × 118259

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 21,996,360

Proper Divisor Sum 12,535,640

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #9460697 ← → #9460723

Radix Representation

Decimal	9460720
Binary	100100000101101111110000 (24 bits)
Octal	0o44055760
Hexadecimal	0x905BF0

Divisor Catalog (20)

1 2 4 5 8 10 16 20 40 80 118,259 236,518 473,036 591,295 946,072 1,182,590 1,892,144 2,365,180 4,730,360 9,460,720

Collatz Trajectory (124 steps to reach 1)

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

9,460,720 4,730,360 2,365,180 1,182,590 591,295 1,773,886 886,943 2,660,830 1,330,415 3,991,246 1,995,623 5,986,870 2,993,435 8,980,306 4,490,153 13,470,460 6,735,230 3,367,615 10,102,846 5,051,423 15,154,270 7,577,135 22,731,406 11,365,703 34,097,110 17,048,555 51,145,666 25,572,833 76,718,500 38,359,250 19,179,625 57,538,876 28,769,438 14,384,719 43,154,158 21,577,079 64,731,238 32,365,619 97,096,858 48,548,429 145,645,288 72,822,644 36,411,322 18,205,661 54,616,984 27,308,492 13,654,246 6,827,123 20,481,370 10,240,685 30,722,056 15,361,028 7,680,514 3,840,257 11,520,772 5,760,386 2,880,193 8,640,580 4,320,290 2,160,145

← Previous Integer #9,460,719 Browse Full Index Next Integer #9,460,721 →