6,459,640

2³ × 5 × 11 × 53 × 277

6,459,640 factors as 2^3 × 5 × 11 × 53 × 277. Its 64 positive divisors give a proper-divisor sum of 9,753,320, so this integer is abundant. The Collatz stopping time is 209 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 11 × 53 × 277

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 16,212,960

Proper Divisor Sum 9,753,320

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #6459637 ← → #6459659

Radix Representation

Decimal	6459640
Binary	11000101001000011111000 (23 bits)
Octal	0o30510370
Hexadecimal	0x6290F8

Divisor Catalog (60 of 64)

1 2 4 5 8 10 11 20 22 40 44 53 55 88 106 110 212 220 265 277 424 440 530 554 583 1,060 1,108 1,166 1,385 2,120 2,216 2,332 2,770 2,915 3,047 4,664 5,540 5,830 6,094 11,080 11,660 12,188 14,681 15,235 23,320 24,376 29,362 30,470 58,724 60,940 73,405 117,448 121,880 146,810 161,491 293,620 322,982 587,240 645,964 807,455

Collatz Trajectory (209 steps to reach 1)

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

6,459,640 3,229,820 1,614,910 807,455 2,422,366 1,211,183 3,633,550 1,816,775 5,450,326 2,725,163 8,175,490 4,087,745 12,263,236 6,131,618 3,065,809 9,197,428 4,598,714 2,299,357 6,898,072 3,449,036 1,724,518 862,259 2,586,778 1,293,389 3,880,168 1,940,084 970,042 485,021 1,455,064 727,532 363,766 181,883 545,650 272,825 818,476 409,238 204,619 613,858 306,929 920,788 460,394 230,197 690,592 345,296 172,648 86,324 43,162 21,581 64,744 32,372 16,186 8,093 24,280 12,140 6,070 3,035 9,106 4,553 13,660 6,830

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