8,895,690

2 × 3³ × 5 × 47 × 701

8,895,690 factors as 2 × 3^3 × 5 × 47 × 701. Its 64 positive divisors give a proper-divisor sum of 15,365,430, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 5 × 47 × 701

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 24,261,120

Proper Divisor Sum 15,365,430

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #8895683 ← → #8895697

Radix Representation

Decimal	8895690
Binary	100001111011110011001010 (24 bits)
Octal	0o41736312
Hexadecimal	0x87BCCA

Divisor Catalog (60 of 64)

1 2 3 5 6 9 10 15 18 27 30 45 47 54 90 94 135 141 235 270 282 423 470 701 705 846 1,269 1,402 1,410 2,103 2,115 2,538 3,505 4,206 4,230 6,309 6,345 7,010 10,515 12,618 12,690 18,927 21,030 31,545 32,947 37,854 63,090 65,894 94,635 98,841 164,735 189,270 197,682 296,523 329,470 494,205 593,046 889,569 988,410 1,482,615

Collatz Trajectory (88 steps to reach 1)

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

8,895,690 4,447,845 13,343,536 6,671,768 3,335,884 1,667,942 833,971 2,501,914 1,250,957 3,752,872 1,876,436 938,218 469,109 1,407,328 703,664 351,832 175,916 87,958 43,979 131,938 65,969 197,908 98,954 49,477 148,432 74,216 37,108 18,554 9,277 27,832 13,916 6,958 3,479 10,438 5,219 15,658 7,829 23,488 11,744 5,872 2,936 1,468 734 367 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

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