8,702,070

2 × 3 × 5 × 13 × 53 × 421

8,702,070 factors as 2 × 3 × 5 × 13 × 53 × 421. Its 64 positive divisors give a proper-divisor sum of 14,268,234, so this integer is abundant. The Collatz stopping time is 124 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 13 × 53 × 421

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 22,970,304

Proper Divisor Sum 14,268,234

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #8702063 ← → #8702093

Radix Representation

Decimal	8702070
Binary	100001001100100001110110 (24 bits)
Octal	0o41144166
Hexadecimal	0x84C876

Divisor Catalog (60 of 64)

1 2 3 5 6 10 13 15 26 30 39 53 65 78 106 130 159 195 265 318 390 421 530 689 795 842 1,263 1,378 1,590 2,067 2,105 2,526 3,445 4,134 4,210 5,473 6,315 6,890 10,335 10,946 12,630 16,419 20,670 22,313 27,365 32,838 44,626 54,730 66,939 82,095 111,565 133,878 164,190 223,130 290,069 334,695 580,138 669,390 870,207 1,450,345

Collatz Trajectory (124 steps to reach 1)

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

8,702,070 4,351,035 13,053,106 6,526,553 19,579,660 9,789,830 4,894,915 14,684,746 7,342,373 22,027,120 11,013,560 5,506,780 2,753,390 1,376,695 4,130,086 2,065,043 6,195,130 3,097,565 9,292,696 4,646,348 2,323,174 1,161,587 3,484,762 1,742,381 5,227,144 2,613,572 1,306,786 653,393 1,960,180 980,090 490,045 1,470,136 735,068 367,534 183,767 551,302 275,651 826,954 413,477 1,240,432 620,216 310,108 155,054 77,527 232,582 116,291 348,874 174,437 523,312 261,656 130,828 65,414 32,707 98,122 49,061 147,184 73,592 36,796 18,398 9,199

← Previous Integer #8,702,069 Browse Full Index Next Integer #8,702,071 →