6,384,640

2¹⁰ × 5 × 29 × 43

6,384,640 factors as 2^10 × 5 × 29 × 43. Its 88 positive divisors give a proper-divisor sum of 9,827,600, so this integer is abundant. The Collatz stopping time is 196 steps.

Prime Factor Structure

Factorization String 2^10 × 5 × 29 × 43

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 88

Divisor Sum (σ) 16,212,240

Proper Divisor Sum 9,827,600

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #6384629 ← → #6384647

Radix Representation

Decimal	6384640
Binary	11000010110110000000000 (23 bits)
Octal	0o30266000
Hexadecimal	0x616C00

Divisor Catalog (60 of 88)

1 2 4 5 8 10 16 20 29 32 40 43 58 64 80 86 116 128 145 160 172 215 232 256 290 320 344 430 464 512 580 640 688 860 928 1,024 1,160 1,247 1,280 1,376 1,720 1,856 2,320 2,494 2,560 2,752 3,440 3,712 4,640 4,988 5,120 5,504 6,235 6,880 7,424 9,280 9,976 11,008 12,470 13,760

Collatz Trajectory (196 steps to reach 1)

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

6,384,640 3,192,320 1,596,160 798,080 399,040 199,520 99,760 49,880 24,940 12,470 6,235 18,706 9,353 28,060 14,030 7,015 21,046 10,523 31,570 15,785 47,356 23,678 11,839 35,518 17,759 53,278 26,639 79,918 39,959 119,878 59,939 179,818 89,909 269,728 134,864 67,432 33,716 16,858 8,429 25,288 12,644 6,322 3,161 9,484 4,742 2,371 7,114 3,557 10,672 5,336 2,668 1,334 667 2,002 1,001 3,004 1,502 751 2,254 1,127

← Previous Integer #6,384,639 Browse Full Index Next Integer #6,384,641 →