9,199,566

2 × 3² × 511087

9,199,566 factors as 2 × 3^2 × 511087. Its 12 positive divisors give a proper-divisor sum of 10,732,866, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 511087

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 19,932,432

Proper Divisor Sum 10,732,866

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #9199559 ← → #9199573

Radix Representation

Decimal	9199566
Binary	100011000101111111001110 (24 bits)
Octal	0o43057716
Hexadecimal	0x8C5FCE

Divisor Catalog (12)

1 2 3 6 9 18 511,087 1,022,174 1,533,261 3,066,522 4,599,783 9,199,566

Collatz Trajectory (132 steps to reach 1)

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

9,199,566 4,599,783 13,799,350 6,899,675 20,699,026 10,349,513 31,048,540 15,524,270 7,762,135 23,286,406 11,643,203 34,929,610 17,464,805 52,394,416 26,197,208 13,098,604 6,549,302 3,274,651 9,823,954 4,911,977 14,735,932 7,367,966 3,683,983 11,051,950 5,525,975 16,577,926 8,288,963 24,866,890 12,433,445 37,300,336 18,650,168 9,325,084 4,662,542 2,331,271 6,993,814 3,496,907 10,490,722 5,245,361 15,736,084 7,868,042 3,934,021 11,802,064 5,901,032 2,950,516 1,475,258 737,629 2,212,888 1,106,444 553,222 276,611 829,834 414,917 1,244,752 622,376 311,188 155,594 77,797 233,392 116,696 58,348

← Previous Integer #9,199,565 Browse Full Index Next Integer #9,199,567 →