8,300,622

2 × 3 × 11 × 31 × 4057

8,300,622 factors as 2 × 3 × 11 × 31 × 4057. Its 32 positive divisors give a proper-divisor sum of 10,398,642, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 31 × 4057

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 18,699,264

Proper Divisor Sum 10,398,642

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #8300603 ← → #8300659

Radix Representation

Decimal	8300622
Binary	11111101010100001001110 (23 bits)
Octal	0o37524116
Hexadecimal	0x7EA84E

Divisor Catalog (32)

1 2 3 6 11 22 31 33 62 66 93 186 341 682 1,023 2,046 4,057 8,114 12,171 24,342 44,627 89,254 125,767 133,881 251,534 267,762 377,301 754,602 1,383,437 2,766,874 4,150,311 8,300,622

Collatz Trajectory (168 steps to reach 1)

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

8,300,622 4,150,311 12,450,934 6,225,467 18,676,402 9,338,201 28,014,604 14,007,302 7,003,651 21,010,954 10,505,477 31,516,432 15,758,216 7,879,108 3,939,554 1,969,777 5,909,332 2,954,666 1,477,333 4,432,000 2,216,000 1,108,000 554,000 277,000 138,500 69,250 34,625 103,876 51,938 25,969 77,908 38,954 19,477 58,432 29,216 14,608 7,304 3,652 1,826 913 2,740 1,370 685 2,056 1,028 514 257 772 386 193 580 290 145 436 218 109 328 164 82 41

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