2,770,932

2² × 3 × 17³ × 47

2,770,932 factors as 2^2 × 3 × 17^3 × 47. Its 48 positive divisors give a proper-divisor sum of 4,244,748, so this integer is abundant. The Collatz stopping time is 156 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 17^3 × 47

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 7,015,680

Proper Divisor Sum 4,244,748

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2770927 ← → #2770939

Radix Representation

Decimal	2770932
Binary	1010100100011111110100 (22 bits)
Octal	0o12443764
Hexadecimal	0x2A47F4

Divisor Catalog (48)

1 2 3 4 6 12 17 34 47 51 68 94 102 141 188 204 282 289 564 578 799 867 1,156 1,598 1,734 2,397 3,196 3,468 4,794 4,913 9,588 9,826 13,583 14,739 19,652 27,166 29,478 40,749 54,332 58,956 81,498 162,996 230,911 461,822 692,733 923,644 1,385,466 2,770,932

Collatz Trajectory (156 steps to reach 1)

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

2,770,932 1,385,466 692,733 2,078,200 1,039,100 519,550 259,775 779,326 389,663 1,168,990 584,495 1,753,486 876,743 2,630,230 1,315,115 3,945,346 1,972,673 5,918,020 2,959,010 1,479,505 4,438,516 2,219,258 1,109,629 3,328,888 1,664,444 832,222 416,111 1,248,334 624,167 1,872,502 936,251 2,808,754 1,404,377 4,213,132 2,106,566 1,053,283 3,159,850 1,579,925 4,739,776 2,369,888 1,184,944 592,472 296,236 148,118 74,059 222,178 111,089 333,268 166,634 83,317 249,952 124,976 62,488 31,244 15,622 7,811 23,434 11,717 35,152 17,576

← Previous Integer #2,770,931 Browse Full Index Next Integer #2,770,933 →