2,254,866

2 × 3 × 29 × 12959

2,254,866 factors as 2 × 3 × 29 × 12959. Its 16 positive divisors give a proper-divisor sum of 2,410,734, so this integer is abundant. The Collatz stopping time is 135 steps.

Prime Factor Structure

Factorization String 2 × 3 × 29 × 12959

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,665,600

Proper Divisor Sum 2,410,734

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2254853 ← → #2254871

Radix Representation

Decimal	2254866
Binary	1000100110100000010010 (22 bits)
Octal	0o10464022
Hexadecimal	0x226812

Divisor Catalog (16)

1 2 3 6 29 58 87 174 12,959 25,918 38,877 77,754 375,811 751,622 1,127,433 2,254,866

Collatz Trajectory (135 steps to reach 1)

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

2,254,866 1,127,433 3,382,300 1,691,150 845,575 2,536,726 1,268,363 3,805,090 1,902,545 5,707,636 2,853,818 1,426,909 4,280,728 2,140,364 1,070,182 535,091 1,605,274 802,637 2,407,912 1,203,956 601,978 300,989 902,968 451,484 225,742 112,871 338,614 169,307 507,922 253,961 761,884 380,942 190,471 571,414 285,707 857,122 428,561 1,285,684 642,842 321,421 964,264 482,132 241,066 120,533 361,600 180,800 90,400 45,200 22,600 11,300 5,650 2,825 8,476 4,238 2,119 6,358 3,179 9,538 4,769 14,308

← Previous Integer #2,254,865 Browse Full Index Next Integer #2,254,867 →