9,006,606

2 × 3³ × 7 × 23827

9,006,606 factors as 2 × 3^3 × 7 × 23827. Its 32 positive divisors give a proper-divisor sum of 13,868,274, so this integer is abundant. The Collatz stopping time is 199 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 7 × 23827

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 22,874,880

Proper Divisor Sum 13,868,274

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9006601 ← → #9006611

Radix Representation

Decimal	9006606
Binary	100010010110111000001110 (24 bits)
Octal	0o42267016
Hexadecimal	0x896E0E

Divisor Catalog (32)

1 2 3 6 7 9 14 18 21 27 42 54 63 126 189 378 23,827 47,654 71,481 142,962 166,789 214,443 333,578 428,886 500,367 643,329 1,000,734 1,286,658 1,501,101 3,002,202 4,503,303 9,006,606

Collatz Trajectory (199 steps to reach 1)

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

9,006,606 4,503,303 13,509,910 6,754,955 20,264,866 10,132,433 30,397,300 15,198,650 7,599,325 22,797,976 11,398,988 5,699,494 2,849,747 8,549,242 4,274,621 12,823,864 6,411,932 3,205,966 1,602,983 4,808,950 2,404,475 7,213,426 3,606,713 10,820,140 5,410,070 2,705,035 8,115,106 4,057,553 12,172,660 6,086,330 3,043,165 9,129,496 4,564,748 2,282,374 1,141,187 3,423,562 1,711,781 5,135,344 2,567,672 1,283,836 641,918 320,959 962,878 481,439 1,444,318 722,159 2,166,478 1,083,239 3,249,718 1,624,859 4,874,578 2,437,289 7,311,868 3,655,934 1,827,967 5,483,902 2,741,951 8,225,854 4,112,927 12,338,782

← Previous Integer #9,006,605 Browse Full Index Next Integer #9,006,607 →