2,990,340

2² × 3² × 5 × 37 × 449

2,990,340 factors as 2^2 × 3^2 × 5 × 37 × 449. Its 72 positive divisors give a proper-divisor sum of 6,346,260, so this integer is abundant. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 5 × 37 × 449

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 9,336,600

Proper Divisor Sum 6,346,260

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2990333 ← → #2990347

Radix Representation

Decimal	2990340
Binary	1011011010000100000100 (22 bits)
Octal	0o13320404
Hexadecimal	0x2DA104

Divisor Catalog (60 of 72)

1 2 3 4 5 6 9 10 12 15 18 20 30 36 37 45 60 74 90 111 148 180 185 222 333 370 444 449 555 666 740 898 1,110 1,332 1,347 1,665 1,796 2,220 2,245 2,694 3,330 4,041 4,490 5,388 6,660 6,735 8,082 8,980 13,470 16,164 16,613 20,205 26,940 33,226 40,410 49,839 66,452 80,820 83,065 99,678

Collatz Trajectory (138 steps to reach 1)

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

2,990,340 1,495,170 747,585 2,242,756 1,121,378 560,689 1,682,068 841,034 420,517 1,261,552 630,776 315,388 157,694 78,847 236,542 118,271 354,814 177,407 532,222 266,111 798,334 399,167 1,197,502 598,751 1,796,254 898,127 2,694,382 1,347,191 4,041,574 2,020,787 6,062,362 3,031,181 9,093,544 4,546,772 2,273,386 1,136,693 3,410,080 1,705,040 852,520 426,260 213,130 106,565 319,696 159,848 79,924 39,962 19,981 59,944 29,972 14,986 7,493 22,480 11,240 5,620 2,810 1,405 4,216 2,108 1,054 527

← Previous Integer #2,990,339 Browse Full Index Next Integer #2,990,341 →