921,680

2⁴ × 5 × 41 × 281

921,680 factors as 2^4 × 5 × 41 × 281. Its 40 positive divisors give a proper-divisor sum of 1,281,304, so this integer is abundant. The Collatz stopping time is 170 steps.

Prime Factor Structure

Factorization String 2^4 × 5 × 41 × 281

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 2,202,984

Proper Divisor Sum 1,281,304

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #921677 ← → #921703

Radix Representation

Decimal	921680
Binary	11100001000001010000 (20 bits)
Octal	0o3410120
Hexadecimal	0xE1050

Divisor Catalog (40)

1 2 4 5 8 10 16 20 40 41 80 82 164 205 281 328 410 562 656 820 1,124 1,405 1,640 2,248 2,810 3,280 4,496 5,620 11,240 11,521 22,480 23,042 46,084 57,605 92,168 115,210 184,336 230,420 460,840 921,680

Collatz Trajectory (170 steps to reach 1)

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

921,680 460,840 230,420 115,210 57,605 172,816 86,408 43,204 21,602 10,801 32,404 16,202 8,101 24,304 12,152 6,076 3,038 1,519 4,558 2,279 6,838 3,419 10,258 5,129 15,388 7,694 3,847 11,542 5,771 17,314 8,657 25,972 12,986 6,493 19,480 9,740 4,870 2,435 7,306 3,653 10,960 5,480 2,740 1,370 685 2,056 1,028 514 257 772 386 193 580 290 145 436 218 109 328 164

← Previous Integer #921,679 Browse Full Index Next Integer #921,681 →