9,980,808

2³ × 3 × 197 × 2111

9,980,808 factors as 2^3 × 3 × 197 × 2111. Its 32 positive divisors give a proper-divisor sum of 15,109,752, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 197 × 2111

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 25,090,560

Proper Divisor Sum 15,109,752

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9980777 ← → #9980813

Radix Representation

Decimal	9980808
Binary	100110000100101110001000 (24 bits)
Octal	0o46045610
Hexadecimal	0x984B88

Divisor Catalog (32)

1 2 3 4 6 8 12 24 197 394 591 788 1,182 1,576 2,111 2,364 4,222 4,728 6,333 8,444 12,666 16,888 25,332 50,664 415,867 831,734 1,247,601 1,663,468 2,495,202 3,326,936 4,990,404 9,980,808

Collatz Trajectory (145 steps to reach 1)

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

9,980,808 4,990,404 2,495,202 1,247,601 3,742,804 1,871,402 935,701 2,807,104 1,403,552 701,776 350,888 175,444 87,722 43,861 131,584 65,792 32,896 16,448 8,224 4,112 2,056 1,028 514 257 772 386 193 580 290 145 436 218 109 328 164 82 41 124 62 31 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310

← Previous Integer #9,980,807 Browse Full Index Next Integer #9,980,809 →