8,269,422

2 × 3 × 7 × 401 × 491

8,269,422 factors as 2 × 3 × 7 × 401 × 491. Its 32 positive divisors give a proper-divisor sum of 10,717,842, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 401 × 491

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 18,987,264

Proper Divisor Sum 10,717,842

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #8269411 ← → #8269423

Radix Representation

Decimal	8269422
Binary	11111100010111001101110 (23 bits)
Octal	0o37427156
Hexadecimal	0x7E2E6E

Divisor Catalog (32)

1 2 3 6 7 14 21 42 401 491 802 982 1,203 1,473 2,406 2,807 2,946 3,437 5,614 6,874 8,421 10,311 16,842 20,622 196,891 393,782 590,673 1,181,346 1,378,237 2,756,474 4,134,711 8,269,422

Collatz Trajectory (106 steps to reach 1)

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

8,269,422 4,134,711 12,404,134 6,202,067 18,606,202 9,303,101 27,909,304 13,954,652 6,977,326 3,488,663 10,465,990 5,232,995 15,698,986 7,849,493 23,548,480 11,774,240 5,887,120 2,943,560 1,471,780 735,890 367,945 1,103,836 551,918 275,959 827,878 413,939 1,241,818 620,909 1,862,728 931,364 465,682 232,841 698,524 349,262 174,631 523,894 261,947 785,842 392,921 1,178,764 589,382 294,691 884,074 442,037 1,326,112 663,056 331,528 165,764 82,882 41,441 124,324 62,162 31,081 93,244 46,622 23,311 69,934 34,967 104,902 52,451

← Previous Integer #8,269,421 Browse Full Index Next Integer #8,269,423 →