8,648,466

2 × 3 × 1441411

8,648,466 factors as 2 × 3 × 1441411. Its 8 positive divisors give a proper-divisor sum of 8,648,478, so this integer is abundant. The Collatz stopping time is 230 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1441411

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 17,296,944

Proper Divisor Sum 8,648,478

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #8648459 ← → #8648501

Radix Representation

Decimal	8648466
Binary	100000111111011100010010 (24 bits)
Octal	0o40773422
Hexadecimal	0x83F712

Divisor Catalog (8)

1 2 3 6 1,441,411 2,882,822 4,324,233 8,648,466

Collatz Trajectory (230 steps to reach 1)

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

8,648,466 4,324,233 12,972,700 6,486,350 3,243,175 9,729,526 4,864,763 14,594,290 7,297,145 21,891,436 10,945,718 5,472,859 16,418,578 8,209,289 24,627,868 12,313,934 6,156,967 18,470,902 9,235,451 27,706,354 13,853,177 41,559,532 20,779,766 10,389,883 31,169,650 15,584,825 46,754,476 23,377,238 11,688,619 35,065,858 17,532,929 52,598,788 26,299,394 13,149,697 39,449,092 19,724,546 9,862,273 29,586,820 14,793,410 7,396,705 22,190,116 11,095,058 5,547,529 16,642,588 8,321,294 4,160,647 12,481,942 6,240,971 18,722,914 9,361,457 28,084,372 14,042,186 7,021,093 21,063,280 10,531,640 5,265,820 2,632,910 1,316,455 3,949,366 1,974,683

← Previous Integer #8,648,465 Browse Full Index Next Integer #8,648,467 →