2,984,196

2² × 3 × 248683

2,984,196 factors as 2^2 × 3 × 248683. Its 12 positive divisors give a proper-divisor sum of 3,978,956, so this integer is abundant. The Collatz stopping time is 182 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 248683

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,963,152

Proper Divisor Sum 3,978,956

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2984183 ← → #2984203

Radix Representation

Decimal	2984196
Binary	1011011000100100000100 (22 bits)
Octal	0o13304404
Hexadecimal	0x2D8904

Divisor Catalog (12)

1 2 3 4 6 12 248,683 497,366 746,049 994,732 1,492,098 2,984,196

Collatz Trajectory (182 steps to reach 1)

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

2,984,196 1,492,098 746,049 2,238,148 1,119,074 559,537 1,678,612 839,306 419,653 1,258,960 629,480 314,740 157,370 78,685 236,056 118,028 59,014 29,507 88,522 44,261 132,784 66,392 33,196 16,598 8,299 24,898 12,449 37,348 18,674 9,337 28,012 14,006 7,003 21,010 10,505 31,516 15,758 7,879 23,638 11,819 35,458 17,729 53,188 26,594 13,297 39,892 19,946 9,973 29,920 14,960 7,480 3,740 1,870 935 2,806 1,403 4,210 2,105 6,316 3,158

← Previous Integer #2,984,195 Browse Full Index Next Integer #2,984,197 →