2,804,874

2 × 3 × 467479

2,804,874 factors as 2 × 3 × 467479. Its 8 positive divisors give a proper-divisor sum of 2,804,886, so this integer is abundant. The Collatz stopping time is 169 steps.

Prime Factor Structure

Factorization String 2 × 3 × 467479

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,609,760

Proper Divisor Sum 2,804,886

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2804861 ← → #2804887

Radix Representation

Decimal	2804874
Binary	1010101100110010001010 (22 bits)
Octal	0o12546212
Hexadecimal	0x2ACC8A

Divisor Catalog (8)

1 2 3 6 467,479 934,958 1,402,437 2,804,874

Collatz Trajectory (169 steps to reach 1)

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

2,804,874 1,402,437 4,207,312 2,103,656 1,051,828 525,914 262,957 788,872 394,436 197,218 98,609 295,828 147,914 73,957 221,872 110,936 55,468 27,734 13,867 41,602 20,801 62,404 31,202 15,601 46,804 23,402 11,701 35,104 17,552 8,776 4,388 2,194 1,097 3,292 1,646 823 2,470 1,235 3,706 1,853 5,560 2,780 1,390 695 2,086 1,043 3,130 1,565 4,696 2,348 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,804,873 Browse Full Index Next Integer #2,804,875 →