8,268,144

2⁴ × 3 × 281 × 613

8,268,144 factors as 2^4 × 3 × 281 × 613. Its 40 positive divisors give a proper-divisor sum of 13,202,208, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 281 × 613

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 21,470,352

Proper Divisor Sum 13,202,208

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #8268079 ← → #8268149

Radix Representation

Decimal	8268144
Binary	11111100010100101110000 (23 bits)
Octal	0o37424560
Hexadecimal	0x7E2970

Divisor Catalog (40)

1 2 3 4 6 8 12 16 24 48 281 562 613 843 1,124 1,226 1,686 1,839 2,248 2,452 3,372 3,678 4,496 4,904 6,744 7,356 9,808 13,488 14,712 29,424 172,253 344,506 516,759 689,012 1,033,518 1,378,024 2,067,036 2,756,048 4,134,072 8,268,144

Collatz Trajectory (106 steps to reach 1)

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

8,268,144 4,134,072 2,067,036 1,033,518 516,759 1,550,278 775,139 2,325,418 1,162,709 3,488,128 1,744,064 872,032 436,016 218,008 109,004 54,502 27,251 81,754 40,877 122,632 61,316 30,658 15,329 45,988 22,994 11,497 34,492 17,246 8,623 25,870 12,935 38,806 19,403 58,210 29,105 87,316 43,658 21,829 65,488 32,744 16,372 8,186 4,093 12,280 6,140 3,070 1,535 4,606 2,303 6,910 3,455 10,366 5,183 15,550 7,775 23,326 11,663 34,990 17,495 52,486

← Previous Integer #8,268,143 Browse Full Index Next Integer #8,268,145 →