8,437,278

2 × 3 × 1406213

8,437,278 factors as 2 × 3 × 1406213. Its 8 positive divisors give a proper-divisor sum of 8,437,290, so this integer is abundant. The Collatz stopping time is 155 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1406213

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 16,874,568

Proper Divisor Sum 8,437,290

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8437259 ← → #8437291

Radix Representation

Decimal	8437278
Binary	100000001011111000011110 (24 bits)
Octal	0o40137036
Hexadecimal	0x80BE1E

Divisor Catalog (8)

1 2 3 6 1,406,213 2,812,426 4,218,639 8,437,278

Collatz Trajectory (155 steps to reach 1)

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

8,437,278 4,218,639 12,655,918 6,327,959 18,983,878 9,491,939 28,475,818 14,237,909 42,713,728 21,356,864 10,678,432 5,339,216 2,669,608 1,334,804 667,402 333,701 1,001,104 500,552 250,276 125,138 62,569 187,708 93,854 46,927 140,782 70,391 211,174 105,587 316,762 158,381 475,144 237,572 118,786 59,393 178,180 89,090 44,545 133,636 66,818 33,409 100,228 50,114 25,057 75,172 37,586 18,793 56,380 28,190 14,095 42,286 21,143 63,430 31,715 95,146 47,573 142,720 71,360 35,680 17,840 8,920

← Previous Integer #8,437,277 Browse Full Index Next Integer #8,437,279 →