2,094,976

2⁷ × 13 × 1259

2,094,976 factors as 2^7 × 13 × 1259. Its 32 positive divisors give a proper-divisor sum of 2,403,224, so this integer is abundant. The Collatz stopping time is 197 steps.

Prime Factor Structure

Factorization String 2^7 × 13 × 1259

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 4,498,200

Proper Divisor Sum 2,403,224

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #2094973 ← → #2094979

Radix Representation

Decimal	2094976
Binary	111111111011110000000 (21 bits)
Octal	0o7773600
Hexadecimal	0x1FF780

Divisor Catalog (32)

1 2 4 8 13 16 26 32 52 64 104 128 208 416 832 1,259 1,664 2,518 5,036 10,072 16,367 20,144 32,734 40,288 65,468 80,576 130,936 161,152 261,872 523,744 1,047,488 2,094,976

Collatz Trajectory (197 steps to reach 1)

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

2,094,976 1,047,488 523,744 261,872 130,936 65,468 32,734 16,367 49,102 24,551 73,654 36,827 110,482 55,241 165,724 82,862 41,431 124,294 62,147 186,442 93,221 279,664 139,832 69,916 34,958 17,479 52,438 26,219 78,658 39,329 117,988 58,994 29,497 88,492 44,246 22,123 66,370 33,185 99,556 49,778 24,889 74,668 37,334 18,667 56,002 28,001 84,004 42,002 21,001 63,004 31,502 15,751 47,254 23,627 70,882 35,441 106,324 53,162 26,581 79,744

← Previous Integer #2,094,975 Browse Full Index Next Integer #2,094,977 →