8,561,856

2⁶ × 3 × 19 × 2347

8,561,856 factors as 2^6 × 3 × 19 × 2347. Its 56 positive divisors give a proper-divisor sum of 15,293,824, so this integer is abundant. The Collatz stopping time is 124 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 19 × 2347

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 56

Divisor Sum (σ) 23,855,680

Proper Divisor Sum 15,293,824

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8561809 ← → #8561857

Radix Representation

Decimal	8561856
Binary	100000101010010011000000 (24 bits)
Octal	0o40522300
Hexadecimal	0x82A4C0

Divisor Catalog (56)

1 2 3 4 6 8 12 16 19 24 32 38 48 57 64 76 96 114 152 192 228 304 456 608 912 1,216 1,824 2,347 3,648 4,694 7,041 9,388 14,082 18,776 28,164 37,552 44,593 56,328 75,104 89,186 112,656 133,779 150,208 178,372 225,312 267,558 356,744 450,624 535,116 713,488 1,070,232 1,426,976 2,140,464 2,853,952 4,280,928 8,561,856

Collatz Trajectory (124 steps to reach 1)

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

8,561,856 4,280,928 2,140,464 1,070,232 535,116 267,558 133,779 401,338 200,669 602,008 301,004 150,502 75,251 225,754 112,877 338,632 169,316 84,658 42,329 126,988 63,494 31,747 95,242 47,621 142,864 71,432 35,716 17,858 8,929 26,788 13,394 6,697 20,092 10,046 5,023 15,070 7,535 22,606 11,303 33,910 16,955 50,866 25,433 76,300 38,150 19,075 57,226 28,613 85,840 42,920 21,460 10,730 5,365 16,096 8,048 4,024 2,012 1,006 503 1,510

← Previous Integer #8,561,855 Browse Full Index Next Integer #8,561,857 →