8,213,898

2 × 3 × 7 × 11 × 23 × 773

8,213,898 factors as 2 × 3 × 7 × 11 × 23 × 773. Its 64 positive divisors give a proper-divisor sum of 13,185,654, so this integer is abundant. The Collatz stopping time is 155 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 11 × 23 × 773

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 21,399,552

Proper Divisor Sum 13,185,654

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8213897 ← → #8213951

Radix Representation

Decimal	8213898
Binary	11111010101010110001010 (23 bits)
Octal	0o37252612
Hexadecimal	0x7D558A

Divisor Catalog (60 of 64)

1 2 3 6 7 11 14 21 22 23 33 42 46 66 69 77 138 154 161 231 253 322 462 483 506 759 773 966 1,518 1,546 1,771 2,319 3,542 4,638 5,313 5,411 8,503 10,626 10,822 16,233 17,006 17,779 25,509 32,466 35,558 51,018 53,337 59,521 106,674 119,042 124,453 178,563 195,569 248,906 357,126 373,359 391,138 586,707 746,718 1,173,414

Collatz Trajectory (155 steps to reach 1)

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

8,213,898 4,106,949 12,320,848 6,160,424 3,080,212 1,540,106 770,053 2,310,160 1,155,080 577,540 288,770 144,385 433,156 216,578 108,289 324,868 162,434 81,217 243,652 121,826 60,913 182,740 91,370 45,685 137,056 68,528 34,264 17,132 8,566 4,283 12,850 6,425 19,276 9,638 4,819 14,458 7,229 21,688 10,844 5,422 2,711 8,134 4,067 12,202 6,101 18,304 9,152 4,576 2,288 1,144 572 286 143 430 215 646 323 970 485 1,456

← Previous Integer #8,213,897 Browse Full Index Next Integer #8,213,899 →