8,639,076

2² × 3 × 23 × 113 × 277

8,639,076 factors as 2^2 × 3 × 23 × 113 × 277. Its 48 positive divisors give a proper-divisor sum of 12,657,948, so this integer is abundant. The Collatz stopping time is 67 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 23 × 113 × 277

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 21,297,024

Proper Divisor Sum 12,657,948

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8639063 ← → #8639089

Radix Representation

Decimal	8639076
Binary	100000111101001001100100 (24 bits)
Octal	0o40751144
Hexadecimal	0x83D264

Divisor Catalog (48)

1 2 3 4 6 12 23 46 69 92 113 138 226 276 277 339 452 554 678 831 1,108 1,356 1,662 2,599 3,324 5,198 6,371 7,797 10,396 12,742 15,594 19,113 25,484 31,188 31,301 38,226 62,602 76,452 93,903 125,204 187,806 375,612 719,923 1,439,846 2,159,769 2,879,692 4,319,538 8,639,076

Collatz Trajectory (67 steps to reach 1)

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

8,639,076 4,319,538 2,159,769 6,479,308 3,239,654 1,619,827 4,859,482 2,429,741 7,289,224 3,644,612 1,822,306 911,153 2,733,460 1,366,730 683,365 2,050,096 1,025,048 512,524 256,262 128,131 384,394 192,197 576,592 288,296 144,148 72,074 36,037 108,112 54,056 27,028 13,514 6,757 20,272 10,136 5,068 2,534 1,267 3,802 1,901 5,704 2,852 1,426 713 2,140 1,070 535 1,606 803 2,410 1,205 3,616 1,808 904 452 226 113 340 170 85 256

← Previous Integer #8,639,075 Browse Full Index Next Integer #8,639,077 →