2,266,056

2³ × 3⁴ × 13 × 269

2,266,056 factors as 2^3 × 3^4 × 13 × 269. Its 80 positive divisors give a proper-divisor sum of 4,594,644, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2^3 × 3^4 × 13 × 269

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 6,860,700

Proper Divisor Sum 4,594,644

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2266039 ← → #2266063

Radix Representation

Decimal	2266056
Binary	1000101001001111001000 (22 bits)
Octal	0o10511710
Hexadecimal	0x2293C8

Divisor Catalog (60 of 80)

1 2 3 4 6 8 9 12 13 18 24 26 27 36 39 52 54 72 78 81 104 108 117 156 162 216 234 269 312 324 351 468 538 648 702 807 936 1,053 1,076 1,404 1,614 2,106 2,152 2,421 2,808 3,228 3,497 4,212 4,842 6,456 6,994 7,263 8,424 9,684 10,491 13,988 14,526 19,368 20,982 21,789

Collatz Trajectory (86 steps to reach 1)

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

2,266,056 1,133,028 566,514 283,257 849,772 424,886 212,443 637,330 318,665 955,996 477,998 238,999 716,998 358,499 1,075,498 537,749 1,613,248 806,624 403,312 201,656 100,828 50,414 25,207 75,622 37,811 113,434 56,717 170,152 85,076 42,538 21,269 63,808 31,904 15,952 7,976 3,988 1,994 997 2,992 1,496 748 374 187 562 281 844 422 211 634 317 952 476 238 119 358 179 538 269 808 404

← Previous Integer #2,266,055 Browse Full Index Next Integer #2,266,057 →