2,879,904

2⁵ × 3 × 131 × 229

2,879,904 factors as 2^5 × 3 × 131 × 229. Its 48 positive divisors give a proper-divisor sum of 4,770,816, so this integer is abundant. The Collatz stopping time is 94 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 131 × 229

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 7,650,720

Proper Divisor Sum 4,770,816

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2879893 ← → #2879909

Radix Representation

Decimal	2879904
Binary	1010111111000110100000 (22 bits)
Octal	0o12770640
Hexadecimal	0x2BF1A0

Divisor Catalog (48)

1 2 3 4 6 8 12 16 24 32 48 96 131 229 262 393 458 524 687 786 916 1,048 1,374 1,572 1,832 2,096 2,748 3,144 3,664 4,192 5,496 6,288 7,328 10,992 12,576 21,984 29,999 59,998 89,997 119,996 179,994 239,992 359,988 479,984 719,976 959,968 1,439,952 2,879,904

Collatz Trajectory (94 steps to reach 1)

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

2,879,904 1,439,952 719,976 359,988 179,994 89,997 269,992 134,996 67,498 33,749 101,248 50,624 25,312 12,656 6,328 3,164 1,582 791 2,374 1,187 3,562 1,781 5,344 2,672 1,336 668 334 167 502 251 754 377 1,132 566 283 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079 3,238 1,619 4,858 2,429 7,288 3,644 1,822 911 2,734 1,367 4,102 2,051 6,154 3,077

← Previous Integer #2,879,903 Browse Full Index Next Integer #2,879,905 →