9,899,373

3 × 11² × 27271

9,899,373 factors as 3 × 11^2 × 27271. Its 12 positive divisors give a proper-divisor sum of 4,609,331, so this integer is deficient. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 3 × 11^2 × 27271

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 14,508,704

Proper Divisor Sum 4,609,331

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #9899371 ← → #9899377

Radix Representation

Decimal	9899373
Binary	100101110000110101101101 (24 bits)
Octal	0o45606555
Hexadecimal	0x970D6D

Divisor Catalog (12)

1 3 11 33 121 363 27,271 81,813 299,981 899,943 3,299,791 9,899,373

Collatz Trajectory (194 steps to reach 1)

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

9,899,373 29,698,120 14,849,060 7,424,530 3,712,265 11,136,796 5,568,398 2,784,199 8,352,598 4,176,299 12,528,898 6,264,449 18,793,348 9,396,674 4,698,337 14,095,012 7,047,506 3,523,753 10,571,260 5,285,630 2,642,815 7,928,446 3,964,223 11,892,670 5,946,335 17,839,006 8,919,503 26,758,510 13,379,255 40,137,766 20,068,883 60,206,650 30,103,325 90,309,976 45,154,988 22,577,494 11,288,747 33,866,242 16,933,121 50,799,364 25,399,682 12,699,841 38,099,524 19,049,762 9,524,881 28,574,644 14,287,322 7,143,661 21,430,984 10,715,492 5,357,746 2,678,873 8,036,620 4,018,310 2,009,155 6,027,466 3,013,733 9,041,200 4,520,600 2,260,300

← Previous Integer #9,899,372 Browse Full Index Next Integer #9,899,374 →