8,322,066

2 × 3² × 462337

8,322,066 factors as 2 × 3^2 × 462337. Its 12 positive divisors give a proper-divisor sum of 9,709,116, so this integer is abundant. The Collatz stopping time is 93 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 462337

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 18,031,182

Proper Divisor Sum 9,709,116

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #8322029 ← → #8322121

Radix Representation

Decimal	8322066
Binary	11111101111110000010010 (23 bits)
Octal	0o37576022
Hexadecimal	0x7EFC12

Divisor Catalog (12)

1 2 3 6 9 18 462,337 924,674 1,387,011 2,774,022 4,161,033 8,322,066

Collatz Trajectory (93 steps to reach 1)

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

8,322,066 4,161,033 12,483,100 6,241,550 3,120,775 9,362,326 4,681,163 14,043,490 7,021,745 21,065,236 10,532,618 5,266,309 15,798,928 7,899,464 3,949,732 1,974,866 987,433 2,962,300 1,481,150 740,575 2,221,726 1,110,863 3,332,590 1,666,295 4,998,886 2,499,443 7,498,330 3,749,165 11,247,496 5,623,748 2,811,874 1,405,937 4,217,812 2,108,906 1,054,453 3,163,360 1,581,680 790,840 395,420 197,710 98,855 296,566 148,283 444,850 222,425 667,276 333,638 166,819 500,458 250,229 750,688 375,344 187,672 93,836 46,918 23,459 70,378 35,189 105,568 52,784

← Previous Integer #8,322,065 Browse Full Index Next Integer #8,322,067 →