21,671,144

2³ × 11 × 89 × 2767

21,671,144 factors as 2^3 × 11 × 89 × 2767. Its 32 positive divisors give a proper-divisor sum of 23,170,456, so this integer is abundant. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 89 × 2767

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 44,841,600

Proper Divisor Sum 23,170,456

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #21671137 ← → #21671147

Radix Representation

Decimal	21671144
Binary	1010010101010110011101000 (25 bits)
Octal	0o122526350
Hexadecimal	0x14AACE8

Divisor Catalog (32)

1 2 4 8 11 22 44 88 89 178 356 712 979 1,958 2,767 3,916 5,534 7,832 11,068 22,136 30,437 60,874 121,748 243,496 246,263 492,526 985,052 1,970,104 2,708,893 5,417,786 10,835,572 21,671,144

Collatz Trajectory (89 steps to reach 1)

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

21,671,144 10,835,572 5,417,786 2,708,893 8,126,680 4,063,340 2,031,670 1,015,835 3,047,506 1,523,753 4,571,260 2,285,630 1,142,815 3,428,446 1,714,223 5,142,670 2,571,335 7,714,006 3,857,003 11,571,010 5,785,505 17,356,516 8,678,258 4,339,129 13,017,388 6,508,694 3,254,347 9,763,042 4,881,521 14,644,564 7,322,282 3,661,141 10,983,424 5,491,712 2,745,856 1,372,928 686,464 343,232 171,616 85,808 42,904 21,452 10,726 5,363 16,090 8,045 24,136 12,068 6,034 3,017 9,052 4,526 2,263 6,790 3,395 10,186 5,093 15,280 7,640 3,820

← Previous Integer #21,671,143 Browse Full Index Next Integer #21,671,145 →