8,210,622

2 × 3 × 7 × 19 × 10289

8,210,622 factors as 2 × 3 × 7 × 19 × 10289. Its 32 positive divisors give a proper-divisor sum of 11,546,178, so this integer is abundant. The Collatz stopping time is 336 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 19 × 10289

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 19,756,800

Proper Divisor Sum 11,546,178

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #8210621 ← → #8210627

Radix Representation

Decimal	8210622
Binary	11111010100100010111110 (23 bits)
Octal	0o37244276
Hexadecimal	0x7D48BE

Divisor Catalog (32)

1 2 3 6 7 14 19 21 38 42 57 114 133 266 399 798 10,289 20,578 30,867 61,734 72,023 144,046 195,491 216,069 390,982 432,138 586,473 1,172,946 1,368,437 2,736,874 4,105,311 8,210,622

Collatz Trajectory (336 steps to reach 1)

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

8,210,622 4,105,311 12,315,934 6,157,967 18,473,902 9,236,951 27,710,854 13,855,427 41,566,282 20,783,141 62,349,424 31,174,712 15,587,356 7,793,678 3,896,839 11,690,518 5,845,259 17,535,778 8,767,889 26,303,668 13,151,834 6,575,917 19,727,752 9,863,876 4,931,938 2,465,969 7,397,908 3,698,954 1,849,477 5,548,432 2,774,216 1,387,108 693,554 346,777 1,040,332 520,166 260,083 780,250 390,125 1,170,376 585,188 292,594 146,297 438,892 219,446 109,723 329,170 164,585 493,756 246,878 123,439 370,318 185,159 555,478 277,739 833,218 416,609 1,249,828 624,914 312,457

← Previous Integer #8,210,621 Browse Full Index Next Integer #8,210,623 →