5,771,472

2⁴ × 3 × 7 × 89 × 193

5,771,472 factors as 2^4 × 3 × 7 × 89 × 193. Its 80 positive divisors give a proper-divisor sum of 11,548,848, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 7 × 89 × 193

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 17,320,320

Proper Divisor Sum 11,548,848

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5771461 ← → #5771501

Radix Representation

Decimal	5771472
Binary	10110000001000011010000 (23 bits)
Octal	0o26010320
Hexadecimal	0x5810D0

Divisor Catalog (60 of 80)

1 2 3 4 6 7 8 12 14 16 21 24 28 42 48 56 84 89 112 168 178 193 267 336 356 386 534 579 623 712 772 1,068 1,158 1,246 1,351 1,424 1,544 1,869 2,136 2,316 2,492 2,702 3,088 3,738 4,053 4,272 4,632 4,984 5,404 7,476 8,106 9,264 9,968 10,808 14,952 16,212 17,177 21,616 29,904 32,424

Collatz Trajectory (69 steps to reach 1)

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

5,771,472 2,885,736 1,442,868 721,434 360,717 1,082,152 541,076 270,538 135,269 405,808 202,904 101,452 50,726 25,363 76,090 38,045 114,136 57,068 28,534 14,267 42,802 21,401 64,204 32,102 16,051 48,154 24,077 72,232 36,116 18,058 9,029 27,088 13,544 6,772 3,386 1,693 5,080 2,540 1,270 635 1,906 953 2,860 1,430 715 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454 227 682 341 1,024

← Previous Integer #5,771,471 Browse Full Index Next Integer #5,771,473 →