2,563,854

2 × 3 × 427309

2,563,854 factors as 2 × 3 × 427309. Its 8 positive divisors give a proper-divisor sum of 2,563,866, so this integer is abundant. The Collatz stopping time is 73 steps.

Prime Factor Structure

Factorization String 2 × 3 × 427309

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,127,720

Proper Divisor Sum 2,563,866

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2563849 ← → #2563859

Radix Representation

Decimal	2563854
Binary	1001110001111100001110 (22 bits)
Octal	0o11617416
Hexadecimal	0x271F0E

Divisor Catalog (8)

1 2 3 6 427,309 854,618 1,281,927 2,563,854

Collatz Trajectory (73 steps to reach 1)

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

2,563,854 1,281,927 3,845,782 1,922,891 5,768,674 2,884,337 8,653,012 4,326,506 2,163,253 6,489,760 3,244,880 1,622,440 811,220 405,610 202,805 608,416 304,208 152,104 76,052 38,026 19,013 57,040 28,520 14,260 7,130 3,565 10,696 5,348 2,674 1,337 4,012 2,006 1,003 3,010 1,505 4,516 2,258 1,129 3,388 1,694 847 2,542 1,271 3,814 1,907 5,722 2,861 8,584 4,292 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454

← Previous Integer #2,563,853 Browse Full Index Next Integer #2,563,855 →