8,717,046

2 × 3 × 13 × 23 × 43 × 113

8,717,046 factors as 2 × 3 × 13 × 23 × 43 × 113. Its 64 positive divisors give a proper-divisor sum of 11,507,466, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 23 × 43 × 113

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 20,224,512

Proper Divisor Sum 11,507,466

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #8717041 ← → #8717113

Radix Representation

Decimal	8717046
Binary	100001010000001011110110 (24 bits)
Octal	0o41201366
Hexadecimal	0x8502F6

Divisor Catalog (60 of 64)

1 2 3 6 13 23 26 39 43 46 69 78 86 113 129 138 226 258 299 339 559 598 678 897 989 1,118 1,469 1,677 1,794 1,978 2,599 2,938 2,967 3,354 4,407 4,859 5,198 5,934 7,797 8,814 9,718 12,857 14,577 15,594 25,714 29,154 33,787 38,571 63,167 67,574 77,142 101,361 111,757 126,334 189,501 202,722 223,514 335,271 379,002 670,542

Collatz Trajectory (106 steps to reach 1)

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

8,717,046 4,358,523 13,075,570 6,537,785 19,613,356 9,806,678 4,903,339 14,710,018 7,355,009 22,065,028 11,032,514 5,516,257 16,548,772 8,274,386 4,137,193 12,411,580 6,205,790 3,102,895 9,308,686 4,654,343 13,963,030 6,981,515 20,944,546 10,472,273 31,416,820 15,708,410 7,854,205 23,562,616 11,781,308 5,890,654 2,945,327 8,835,982 4,417,991 13,253,974 6,626,987 19,880,962 9,940,481 29,821,444 14,910,722 7,455,361 22,366,084 11,183,042 5,591,521 16,774,564 8,387,282 4,193,641 12,580,924 6,290,462 3,145,231 9,435,694 4,717,847 14,153,542 7,076,771 21,230,314 10,615,157 31,845,472 15,922,736 7,961,368 3,980,684 1,990,342

← Previous Integer #8,717,045 Browse Full Index Next Integer #8,717,047 →