8,245,552

2⁴ × 7 × 83 × 887

8,245,552 factors as 2^4 × 7 × 83 × 887. Its 40 positive divisors give a proper-divisor sum of 10,253,264, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2^4 × 7 × 83 × 887

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 18,498,816

Proper Divisor Sum 10,253,264

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #8245547 ← → #8245571

Radix Representation

Decimal	8245552
Binary	11111011101000100110000 (23 bits)
Octal	0o37350460
Hexadecimal	0x7DD130

Divisor Catalog (40)

1 2 4 7 8 14 16 28 56 83 112 166 332 581 664 887 1,162 1,328 1,774 2,324 3,548 4,648 6,209 7,096 9,296 12,418 14,192 24,836 49,672 73,621 99,344 147,242 294,484 515,347 588,968 1,030,694 1,177,936 2,061,388 4,122,776 8,245,552

Collatz Trajectory (168 steps to reach 1)

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

8,245,552 4,122,776 2,061,388 1,030,694 515,347 1,546,042 773,021 2,319,064 1,159,532 579,766 289,883 869,650 434,825 1,304,476 652,238 326,119 978,358 489,179 1,467,538 733,769 2,201,308 1,100,654 550,327 1,650,982 825,491 2,476,474 1,238,237 3,714,712 1,857,356 928,678 464,339 1,393,018 696,509 2,089,528 1,044,764 522,382 261,191 783,574 391,787 1,175,362 587,681 1,763,044 881,522 440,761 1,322,284 661,142 330,571 991,714 495,857 1,487,572 743,786 371,893 1,115,680 557,840 278,920 139,460 69,730 34,865 104,596 52,298

← Previous Integer #8,245,551 Browse Full Index Next Integer #8,245,553 →