9,083,082

2 × 3 × 419 × 3613

9,083,082 factors as 2 × 3 × 419 × 3613. Its 16 positive divisors give a proper-divisor sum of 9,131,478, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 3 × 419 × 3613

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 18,214,560

Proper Divisor Sum 9,131,478

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9083077 ← → #9083111

Radix Representation

Decimal	9083082
Binary	100010101001100011001010 (24 bits)
Octal	0o42514312
Hexadecimal	0x8A98CA

Divisor Catalog (16)

1 2 3 6 419 838 1,257 2,514 3,613 7,226 10,839 21,678 1,513,847 3,027,694 4,541,541 9,083,082

Collatz Trajectory (88 steps to reach 1)

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

9,083,082 4,541,541 13,624,624 6,812,312 3,406,156 1,703,078 851,539 2,554,618 1,277,309 3,831,928 1,915,964 957,982 478,991 1,436,974 718,487 2,155,462 1,077,731 3,233,194 1,616,597 4,849,792 2,424,896 1,212,448 606,224 303,112 151,556 75,778 37,889 113,668 56,834 28,417 85,252 42,626 21,313 63,940 31,970 15,985 47,956 23,978 11,989 35,968 17,984 8,992 4,496 2,248 1,124 562 281 844 422 211 634 317 952 476 238 119 358 179 538 269

← Previous Integer #9,083,081 Browse Full Index Next Integer #9,083,083 →