3,036,858

2 × 3 × 11² × 47 × 89

3,036,858 factors as 2 × 3 × 11^2 × 47 × 89. Its 48 positive divisors give a proper-divisor sum of 3,857,862, so this integer is abundant. The Collatz stopping time is 195 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11^2 × 47 × 89

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 6,894,720

Proper Divisor Sum 3,857,862

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3036857 ← → #3036871

Radix Representation

Decimal	3036858
Binary	1011100101011010111010 (22 bits)
Octal	0o13453272
Hexadecimal	0x2E56BA

Divisor Catalog (48)

1 2 3 6 11 22 33 47 66 89 94 121 141 178 242 267 282 363 517 534 726 979 1,034 1,551 1,958 2,937 3,102 4,183 5,687 5,874 8,366 10,769 11,374 12,549 17,061 21,538 25,098 32,307 34,122 46,013 64,614 92,026 138,039 276,078 506,143 1,012,286 1,518,429 3,036,858

Collatz Trajectory (195 steps to reach 1)

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

3,036,858 1,518,429 4,555,288 2,277,644 1,138,822 569,411 1,708,234 854,117 2,562,352 1,281,176 640,588 320,294 160,147 480,442 240,221 720,664 360,332 180,166 90,083 270,250 135,125 405,376 202,688 101,344 50,672 25,336 12,668 6,334 3,167 9,502 4,751 14,254 7,127 21,382 10,691 32,074 16,037 48,112 24,056 12,028 6,014 3,007 9,022 4,511 13,534 6,767 20,302 10,151 30,454 15,227 45,682 22,841 68,524 34,262 17,131 51,394 25,697 77,092 38,546 19,273

← Previous Integer #3,036,857 Browse Full Index Next Integer #3,036,859 →