5,911,552

2¹⁰ × 23 × 251

5,911,552 factors as 2^10 × 23 × 251. Its 44 positive divisors give a proper-divisor sum of 6,468,704, so this integer is abundant. The Collatz stopping time is 59 steps.

Prime Factor Structure

Factorization String 2^10 × 23 × 251

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 44

Divisor Sum (σ) 12,380,256

Proper Divisor Sum 6,468,704

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #5911547 ← → #5911553

Radix Representation

Decimal	5911552
Binary	10110100011010000000000 (23 bits)
Octal	0o26432000
Hexadecimal	0x5A3400

Divisor Catalog (44)

1 2 4 8 16 23 32 46 64 92 128 184 251 256 368 502 512 736 1,004 1,024 1,472 2,008 2,944 4,016 5,773 5,888 8,032 11,546 11,776 16,064 23,092 23,552 32,128 46,184 64,256 92,368 128,512 184,736 257,024 369,472 738,944 1,477,888 2,955,776 5,911,552

Collatz Trajectory (59 steps to reach 1)

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

5,911,552 2,955,776 1,477,888 738,944 369,472 184,736 92,368 46,184 23,092 11,546 5,773 17,320 8,660 4,330 2,165 6,496 3,248 1,624 812 406 203 610 305 916 458 229 688 344 172 86 43 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

← Previous Integer #5,911,551 Browse Full Index Next Integer #5,911,553 →