8,551,690

2 × 5 × 7 × 122167

8,551,690 factors as 2 × 5 × 7 × 122167. Its 16 positive divisors give a proper-divisor sum of 9,040,502, so this integer is abundant. The Collatz stopping time is 75 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 122167

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 17,592,192

Proper Divisor Sum 9,040,502

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #8551687 ← → #8551721

Radix Representation

Decimal	8551690
Binary	100000100111110100001010 (24 bits)
Octal	0o40476412
Hexadecimal	0x827D0A

Divisor Catalog (16)

1 2 5 7 10 14 35 70 122,167 244,334 610,835 855,169 1,221,670 1,710,338 4,275,845 8,551,690

Collatz Trajectory (75 steps to reach 1)

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

8,551,690 4,275,845 12,827,536 6,413,768 3,206,884 1,603,442 801,721 2,405,164 1,202,582 601,291 1,803,874 901,937 2,705,812 1,352,906 676,453 2,029,360 1,014,680 507,340 253,670 126,835 380,506 190,253 570,760 285,380 142,690 71,345 214,036 107,018 53,509 160,528 80,264 40,132 20,066 10,033 30,100 15,050 7,525 22,576 11,288 5,644 2,822 1,411 4,234 2,117 6,352 3,176 1,588 794 397 1,192 596 298 149 448 224 112 56 28 14 7

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,551,689 Browse Full Index Next Integer #8,551,691 →