9,941,760

2⁸ × 3² × 5 × 863

9,941,760 factors as 2^8 × 3^2 × 5 × 863. Its 108 positive divisors give a proper-divisor sum of 24,495,552, so this integer is abundant. The Collatz stopping time is 31 steps.

Prime Factor Structure

Factorization String 2^8 × 3^2 × 5 × 863

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 108

Divisor Sum (σ) 34,437,312

Proper Divisor Sum 24,495,552

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9941749 ← → #9941761

Radix Representation

Decimal	9941760
Binary	100101111011001100000000 (24 bits)
Octal	0o45731400
Hexadecimal	0x97B300

Divisor Catalog (60 of 108)

1 2 3 4 5 6 8 9 10 12 15 16 18 20 24 30 32 36 40 45 48 60 64 72 80 90 96 120 128 144 160 180 192 240 256 288 320 360 384 480 576 640 720 768 863 960 1,152 1,280 1,440 1,726 1,920 2,304 2,589 2,880 3,452 3,840 4,315 5,178 5,760 6,904

Collatz Trajectory (31 steps to reach 1)

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

9,941,760 4,970,880 2,485,440 1,242,720 621,360 310,680 155,340 77,670 38,835 116,506 58,253 174,760 87,380 43,690 21,845 65,536 32,768 16,384 8,192 4,096 2,048 1,024 512 256 128 64 32 16 8 4 2 1

← Previous Integer #9,941,759 Browse Full Index Next Integer #9,941,761 →