8,866,752

2⁶ × 3 × 46181

8,866,752 factors as 2^6 × 3 × 46181. Its 28 positive divisors give a proper-divisor sum of 14,593,704, so this integer is abundant. The Collatz stopping time is 212 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 46181

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 23,460,456

Proper Divisor Sum 14,593,704

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #8866751 ← → #8866801

Radix Representation

Decimal	8866752
Binary	100001110100101111000000 (24 bits)
Octal	0o41645700
Hexadecimal	0x874BC0

Divisor Catalog (28)

1 2 3 4 6 8 12 16 24 32 48 64 96 192 46,181 92,362 138,543 184,724 277,086 369,448 554,172 738,896 1,108,344 1,477,792 2,216,688 2,955,584 4,433,376 8,866,752

Collatz Trajectory (212 steps to reach 1)

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

8,866,752 4,433,376 2,216,688 1,108,344 554,172 277,086 138,543 415,630 207,815 623,446 311,723 935,170 467,585 1,402,756 701,378 350,689 1,052,068 526,034 263,017 789,052 394,526 197,263 591,790 295,895 887,686 443,843 1,331,530 665,765 1,997,296 998,648 499,324 249,662 124,831 374,494 187,247 561,742 280,871 842,614 421,307 1,263,922 631,961 1,895,884 947,942 473,971 1,421,914 710,957 2,132,872 1,066,436 533,218 266,609 799,828 399,914 199,957 599,872 299,936 149,968 74,984 37,492 18,746 9,373

← Previous Integer #8,866,751 Browse Full Index Next Integer #8,866,753 →