8,901,702

2 × 3² × 494539

8,901,702 factors as 2 × 3^2 × 494539. Its 12 positive divisors give a proper-divisor sum of 10,385,358, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 494539

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 19,287,060

Proper Divisor Sum 10,385,358

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #8901701 ← → #8901749

Radix Representation

Decimal	8901702
Binary	100001111101010001000110 (24 bits)
Octal	0o41752106
Hexadecimal	0x87D446

Divisor Catalog (12)

1 2 3 6 9 18 494,539 989,078 1,483,617 2,967,234 4,450,851 8,901,702

Collatz Trajectory (88 steps to reach 1)

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

8,901,702 4,450,851 13,352,554 6,676,277 20,028,832 10,014,416 5,007,208 2,503,604 1,251,802 625,901 1,877,704 938,852 469,426 234,713 704,140 352,070 176,035 528,106 264,053 792,160 396,080 198,040 99,020 49,510 24,755 74,266 37,133 111,400 55,700 27,850 13,925 41,776 20,888 10,444 5,222 2,611 7,834 3,917 11,752 5,876 2,938 1,469 4,408 2,204 1,102 551 1,654 827 2,482 1,241 3,724 1,862 931 2,794 1,397 4,192 2,096 1,048 524 262

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,901,701 Browse Full Index Next Integer #8,901,703 →