2,984,488

2³ × 13 × 28697

2,984,488 factors as 2^3 × 13 × 28697. Its 16 positive divisors give a proper-divisor sum of 3,042,092, so this integer is abundant. The Collatz stopping time is 120 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 28697

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,026,580

Proper Divisor Sum 3,042,092

Digit Sum / Digital Root 43 (Root: 7)

Adjacent Primes #2984479 ← → #2984521

Radix Representation

Decimal	2984488
Binary	1011011000101000101000 (22 bits)
Octal	0o13305050
Hexadecimal	0x2D8A28

Divisor Catalog (16)

1 2 4 8 13 26 52 104 28,697 57,394 114,788 229,576 373,061 746,122 1,492,244 2,984,488

Collatz Trajectory (120 steps to reach 1)

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

2,984,488 1,492,244 746,122 373,061 1,119,184 559,592 279,796 139,898 69,949 209,848 104,924 52,462 26,231 78,694 39,347 118,042 59,021 177,064 88,532 44,266 22,133 66,400 33,200 16,600 8,300 4,150 2,075 6,226 3,113 9,340 4,670 2,335 7,006 3,503 10,510 5,255 15,766 7,883 23,650 11,825 35,476 17,738 8,869 26,608 13,304 6,652 3,326 1,663 4,990 2,495 7,486 3,743 11,230 5,615 16,846 8,423 25,270 12,635 37,906 18,953

← Previous Integer #2,984,487 Browse Full Index Next Integer #2,984,489 →