1,578,714

2 × 3 × 263119

1,578,714 factors as 2 × 3 × 263119. Its 8 positive divisors give a proper-divisor sum of 1,578,726, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2 × 3 × 263119

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,157,440

Proper Divisor Sum 1,578,726

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1578713 ← → #1578719

Radix Representation

Decimal	1578714
Binary	110000001011011011010 (21 bits)
Octal	0o6013332
Hexadecimal	0x1816DA

Divisor Catalog (8)

1 2 3 6 263,119 526,238 789,357 1,578,714

Collatz Trajectory (150 steps to reach 1)

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

1,578,714 789,357 2,368,072 1,184,036 592,018 296,009 888,028 444,014 222,007 666,022 333,011 999,034 499,517 1,498,552 749,276 374,638 187,319 561,958 280,979 842,938 421,469 1,264,408 632,204 316,102 158,051 474,154 237,077 711,232 355,616 177,808 88,904 44,452 22,226 11,113 33,340 16,670 8,335 25,006 12,503 37,510 18,755 56,266 28,133 84,400 42,200 21,100 10,550 5,275 15,826 7,913 23,740 11,870 5,935 17,806 8,903 26,710 13,355 40,066 20,033 60,100

← Previous Integer #1,578,713 Browse Full Index Next Integer #1,578,715 →