8,970,860

2² × 5 × 29 × 15467

8,970,860 factors as 2^2 × 5 × 29 × 15467. Its 24 positive divisors give a proper-divisor sum of 10,518,820, so this integer is abundant. The Collatz stopping time is 212 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 29 × 15467

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 19,489,680

Proper Divisor Sum 10,518,820

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #8970839 ← → #8970877

Radix Representation

Decimal	8970860
Binary	100010001110001001101100 (24 bits)
Octal	0o42161154
Hexadecimal	0x88E26C

Divisor Catalog (24)

1 2 4 5 10 20 29 58 116 145 290 580 15,467 30,934 61,868 77,335 154,670 309,340 448,543 897,086 1,794,172 2,242,715 4,485,430 8,970,860

Collatz Trajectory (212 steps to reach 1)

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

8,970,860 4,485,430 2,242,715 6,728,146 3,364,073 10,092,220 5,046,110 2,523,055 7,569,166 3,784,583 11,353,750 5,676,875 17,030,626 8,515,313 25,545,940 12,772,970 6,386,485 19,159,456 9,579,728 4,789,864 2,394,932 1,197,466 598,733 1,796,200 898,100 449,050 224,525 673,576 336,788 168,394 84,197 252,592 126,296 63,148 31,574 15,787 47,362 23,681 71,044 35,522 17,761 53,284 26,642 13,321 39,964 19,982 9,991 29,974 14,987 44,962 22,481 67,444 33,722 16,861 50,584 25,292 12,646 6,323 18,970 9,485

← Previous Integer #8,970,859 Browse Full Index Next Integer #8,970,861 →