9,920,088

2³ × 3² × 29 × 4751

9,920,088 factors as 2^3 × 3^2 × 29 × 4751. Its 48 positive divisors give a proper-divisor sum of 17,879,112, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2^3 × 3^2 × 29 × 4751

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 27,799,200

Proper Divisor Sum 17,879,112

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9920047 ← → #9920089

Radix Representation

Decimal	9920088
Binary	100101110101111001011000 (24 bits)
Octal	0o45657130
Hexadecimal	0x975E58

Divisor Catalog (48)

1 2 3 4 6 8 9 12 18 24 29 36 58 72 87 116 174 232 261 348 522 696 1,044 2,088 4,751 9,502 14,253 19,004 28,506 38,008 42,759 57,012 85,518 114,024 137,779 171,036 275,558 342,072 413,337 551,116 826,674 1,102,232 1,240,011 1,653,348 2,480,022 3,306,696 4,960,044 9,920,088

Collatz Trajectory (176 steps to reach 1)

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

9,920,088 4,960,044 2,480,022 1,240,011 3,720,034 1,860,017 5,580,052 2,790,026 1,395,013 4,185,040 2,092,520 1,046,260 523,130 261,565 784,696 392,348 196,174 98,087 294,262 147,131 441,394 220,697 662,092 331,046 165,523 496,570 248,285 744,856 372,428 186,214 93,107 279,322 139,661 418,984 209,492 104,746 52,373 157,120 78,560 39,280 19,640 9,820 4,910 2,455 7,366 3,683 11,050 5,525 16,576 8,288 4,144 2,072 1,036 518 259 778 389 1,168 584 292

← Previous Integer #9,920,087 Browse Full Index Next Integer #9,920,089 →