2,807,034

2 × 3 × 587 × 797

2,807,034 factors as 2 × 3 × 587 × 797. Its 16 positive divisors give a proper-divisor sum of 2,823,654, so this integer is abundant. The Collatz stopping time is 200 steps.

Prime Factor Structure

Factorization String 2 × 3 × 587 × 797

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,630,688

Proper Divisor Sum 2,823,654

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2807027 ← → #2807071

Radix Representation

Decimal	2807034
Binary	1010101101010011111010 (22 bits)
Octal	0o12552372
Hexadecimal	0x2AD4FA

Divisor Catalog (16)

1 2 3 6 587 797 1,174 1,594 1,761 2,391 3,522 4,782 467,839 935,678 1,403,517 2,807,034

Collatz Trajectory (200 steps to reach 1)

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

2,807,034 1,403,517 4,210,552 2,105,276 1,052,638 526,319 1,578,958 789,479 2,368,438 1,184,219 3,552,658 1,776,329 5,328,988 2,664,494 1,332,247 3,996,742 1,998,371 5,995,114 2,997,557 8,992,672 4,496,336 2,248,168 1,124,084 562,042 281,021 843,064 421,532 210,766 105,383 316,150 158,075 474,226 237,113 711,340 355,670 177,835 533,506 266,753 800,260 400,130 200,065 600,196 300,098 150,049 450,148 225,074 112,537 337,612 168,806 84,403 253,210 126,605 379,816 189,908 94,954 47,477 142,432 71,216 35,608 17,804

← Previous Integer #2,807,033 Browse Full Index Next Integer #2,807,035 →