8,098,256

2⁴ × 17 × 19 × 1567

8,098,256 factors as 2^4 × 17 × 19 × 1567. Its 40 positive divisors give a proper-divisor sum of 9,400,624, so this integer is abundant. The Collatz stopping time is 199 steps.

Prime Factor Structure

Factorization String 2^4 × 17 × 19 × 1567

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 17,498,880

Proper Divisor Sum 9,400,624

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #8098253 ← → #8098261

Radix Representation

Decimal	8098256
Binary	11110111001000111010000 (23 bits)
Octal	0o36710720
Hexadecimal	0x7B91D0

Divisor Catalog (40)

1 2 4 8 16 17 19 34 38 68 76 136 152 272 304 323 646 1,292 1,567 2,584 3,134 5,168 6,268 12,536 25,072 26,639 29,773 53,278 59,546 106,556 119,092 213,112 238,184 426,224 476,368 506,141 1,012,282 2,024,564 4,049,128 8,098,256

Collatz Trajectory (199 steps to reach 1)

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

8,098,256 4,049,128 2,024,564 1,012,282 506,141 1,518,424 759,212 379,606 189,803 569,410 284,705 854,116 427,058 213,529 640,588 320,294 160,147 480,442 240,221 720,664 360,332 180,166 90,083 270,250 135,125 405,376 202,688 101,344 50,672 25,336 12,668 6,334 3,167 9,502 4,751 14,254 7,127 21,382 10,691 32,074 16,037 48,112 24,056 12,028 6,014 3,007 9,022 4,511 13,534 6,767 20,302 10,151 30,454 15,227 45,682 22,841 68,524 34,262 17,131 51,394

← Previous Integer #8,098,255 Browse Full Index Next Integer #8,098,257 →