4,097,584

2⁴ × 29 × 8831

4,097,584 factors as 2^4 × 29 × 8831. Its 20 positive divisors give a proper-divisor sum of 4,116,176, so this integer is abundant. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2^4 × 29 × 8831

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 8,213,760

Proper Divisor Sum 4,116,176

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #4097579 ← → #4097603

Radix Representation

Decimal	4097584
Binary	1111101000011000110000 (22 bits)
Octal	0o17503060
Hexadecimal	0x3E8630

Divisor Catalog (20)

1 2 4 8 16 29 58 116 232 464 8,831 17,662 35,324 70,648 141,296 256,099 512,198 1,024,396 2,048,792 4,097,584

Collatz Trajectory (92 steps to reach 1)

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

4,097,584 2,048,792 1,024,396 512,198 256,099 768,298 384,149 1,152,448 576,224 288,112 144,056 72,028 36,014 18,007 54,022 27,011 81,034 40,517 121,552 60,776 30,388 15,194 7,597 22,792 11,396 5,698 2,849 8,548 4,274 2,137 6,412 3,206 1,603 4,810 2,405 7,216 3,608 1,804 902 451 1,354 677 2,032 1,016 508 254 127 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372

← Previous Integer #4,097,583 Browse Full Index Next Integer #4,097,585 →