8,689,206

2 × 3 × 61 × 23741

8,689,206 factors as 2 × 3 × 61 × 23741. Its 16 positive divisors give a proper-divisor sum of 8,974,842, so this integer is abundant. The Collatz stopping time is 261 steps.

Prime Factor Structure

Factorization String 2 × 3 × 61 × 23741

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 17,664,048

Proper Divisor Sum 8,974,842

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8689181 ← → #8689217

Radix Representation

Decimal	8689206
Binary	100001001001011000110110 (24 bits)
Octal	0o41113066
Hexadecimal	0x849636

Divisor Catalog (16)

1 2 3 6 61 122 183 366 23,741 47,482 71,223 142,446 1,448,201 2,896,402 4,344,603 8,689,206

Collatz Trajectory (261 steps to reach 1)

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

8,689,206 4,344,603 13,033,810 6,516,905 19,550,716 9,775,358 4,887,679 14,663,038 7,331,519 21,994,558 10,997,279 32,991,838 16,495,919 49,487,758 24,743,879 74,231,638 37,115,819 111,347,458 55,673,729 167,021,188 83,510,594 41,755,297 125,265,892 62,632,946 31,316,473 93,949,420 46,974,710 23,487,355 70,462,066 35,231,033 105,693,100 52,846,550 26,423,275 79,269,826 39,634,913 118,904,740 59,452,370 29,726,185 89,178,556 44,589,278 22,294,639 66,883,918 33,441,959 100,325,878 50,162,939 150,488,818 75,244,409 225,733,228 112,866,614 56,433,307 169,299,922 84,649,961 253,949,884 126,974,942 63,487,471 190,462,414 95,231,207 285,693,622 142,846,811 428,540,434

← Previous Integer #8,689,205 Browse Full Index Next Integer #8,689,207 →