2,792,004

2² × 3 × 29 × 71 × 113

2,792,004 factors as 2^2 × 3 × 29 × 71 × 113. Its 48 positive divisors give a proper-divisor sum of 4,102,716, so this integer is abundant. The Collatz stopping time is 169 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 29 × 71 × 113

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 6,894,720

Proper Divisor Sum 4,102,716

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2791991 ← → #2792011

Radix Representation

Decimal	2792004
Binary	1010101001101001000100 (22 bits)
Octal	0o12515104
Hexadecimal	0x2A9A44

Divisor Catalog (48)

Collatz Trajectory (169 steps to reach 1)

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

2,792,004 1,396,002 698,001 2,094,004 1,047,002 523,501 1,570,504 785,252 392,626 196,313 588,940 294,470 147,235 441,706 220,853 662,560 331,280 165,640 82,820 41,410 20,705 62,116 31,058 15,529 46,588 23,294 11,647 34,942 17,471 52,414 26,207 78,622 39,311 117,934 58,967 176,902 88,451 265,354 132,677 398,032 199,016 99,508 49,754 24,877 74,632 37,316 18,658 9,329 27,988 13,994 6,997 20,992 10,496 5,248 2,624 1,312 656 328 164 82

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,792,003 Browse Full Index Next Integer #2,792,005 →