8,969,160

2³ × 3 × 5 × 41 × 1823

8,969,160 factors as 2^3 × 3 × 5 × 41 × 1823. Its 64 positive divisors give a proper-divisor sum of 18,609,720, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 41 × 1823

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 27,578,880

Proper Divisor Sum 18,609,720

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8969143 ← → #8969171

Radix Representation

Decimal	8969160
Binary	100010001101101111001000 (24 bits)
Octal	0o42155710
Hexadecimal	0x88DBC8

Divisor Catalog (60 of 64)

1 2 3 4 5 6 8 10 12 15 20 24 30 40 41 60 82 120 123 164 205 246 328 410 492 615 820 984 1,230 1,640 1,823 2,460 3,646 4,920 5,469 7,292 9,115 10,938 14,584 18,230 21,876 27,345 36,460 43,752 54,690 72,920 74,743 109,380 149,486 218,760 224,229 298,972 373,715 448,458 597,944 747,430 896,916 1,121,145 1,494,860 1,793,832

Collatz Trajectory (88 steps to reach 1)

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

8,969,160 4,484,580 2,242,290 1,121,145 3,363,436 1,681,718 840,859 2,522,578 1,261,289 3,783,868 1,891,934 945,967 2,837,902 1,418,951 4,256,854 2,128,427 6,385,282 3,192,641 9,577,924 4,788,962 2,394,481 7,183,444 3,591,722 1,795,861 5,387,584 2,693,792 1,346,896 673,448 336,724 168,362 84,181 252,544 126,272 63,136 31,568 15,784 7,892 3,946 1,973 5,920 2,960 1,480 740 370 185 556 278 139 418 209 628 314 157 472 236 118 59 178 89 268

← Previous Integer #8,969,159 Browse Full Index Next Integer #8,969,161 →