8,105,646

2 × 3 × 139 × 9719

8,105,646 factors as 2 × 3 × 139 × 9719. Its 16 positive divisors give a proper-divisor sum of 8,223,954, so this integer is abundant. The Collatz stopping time is 137 steps.

Prime Factor Structure

Factorization String 2 × 3 × 139 × 9719

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 16,329,600

Proper Divisor Sum 8,223,954

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #8105639 ← → #8105653

Radix Representation

Decimal	8105646
Binary	11110111010111010101110 (23 bits)
Octal	0o36727256
Hexadecimal	0x7BAEAE

Divisor Catalog (16)

1 2 3 6 139 278 417 834 9,719 19,438 29,157 58,314 1,350,941 2,701,882 4,052,823 8,105,646

Collatz Trajectory (137 steps to reach 1)

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

8,105,646 4,052,823 12,158,470 6,079,235 18,237,706 9,118,853 27,356,560 13,678,280 6,839,140 3,419,570 1,709,785 5,129,356 2,564,678 1,282,339 3,847,018 1,923,509 5,770,528 2,885,264 1,442,632 721,316 360,658 180,329 540,988 270,494 135,247 405,742 202,871 608,614 304,307 912,922 456,461 1,369,384 684,692 342,346 171,173 513,520 256,760 128,380 64,190 32,095 96,286 48,143 144,430 72,215 216,646 108,323 324,970 162,485 487,456 243,728 121,864 60,932 30,466 15,233 45,700 22,850 11,425 34,276 17,138 8,569

← Previous Integer #8,105,645 Browse Full Index Next Integer #8,105,647 →