9,692,982

2 × 3² × 13 × 23 × 1801

9,692,982 factors as 2 × 3^2 × 13 × 23 × 1801. Its 48 positive divisors give a proper-divisor sum of 13,920,426, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 13 × 23 × 1801

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 23,613,408

Proper Divisor Sum 13,920,426

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #9692981 ← → #9692993

Radix Representation

Decimal	9692982
Binary	100100111110011100110110 (24 bits)
Octal	0o44763466
Hexadecimal	0x93E736

Divisor Catalog (48)

1 2 3 6 9 13 18 23 26 39 46 69 78 117 138 207 234 299 414 598 897 1,794 1,801 2,691 3,602 5,382 5,403 10,806 16,209 23,413 32,418 41,423 46,826 70,239 82,846 124,269 140,478 210,717 248,538 372,807 421,434 538,499 745,614 1,076,998 1,615,497 3,230,994 4,846,491 9,692,982

Collatz Trajectory (163 steps to reach 1)

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

9,692,982 4,846,491 14,539,474 7,269,737 21,809,212 10,904,606 5,452,303 16,356,910 8,178,455 24,535,366 12,267,683 36,803,050 18,401,525 55,204,576 27,602,288 13,801,144 6,900,572 3,450,286 1,725,143 5,175,430 2,587,715 7,763,146 3,881,573 11,644,720 5,822,360 2,911,180 1,455,590 727,795 2,183,386 1,091,693 3,275,080 1,637,540 818,770 409,385 1,228,156 614,078 307,039 921,118 460,559 1,381,678 690,839 2,072,518 1,036,259 3,108,778 1,554,389 4,663,168 2,331,584 1,165,792 582,896 291,448 145,724 72,862 36,431 109,294 54,647 163,942 81,971 245,914 122,957 368,872

← Previous Integer #9,692,981 Browse Full Index Next Integer #9,692,983 →