6,528,990

2 × 3 × 5 × 13 × 16741

6,528,990 factors as 2 × 3 × 5 × 13 × 16741. Its 32 positive divisors give a proper-divisor sum of 10,346,946, so this integer is abundant. The Collatz stopping time is 209 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 13 × 16741

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 16,875,936

Proper Divisor Sum 10,346,946

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6528979 ← → #6529021

Radix Representation

Decimal	6528990
Binary	11000111001111111011110 (23 bits)
Octal	0o30717736
Hexadecimal	0x639FDE

Divisor Catalog (32)

1 2 3 5 6 10 13 15 26 30 39 65 78 130 195 390 16,741 33,482 50,223 83,705 100,446 167,410 217,633 251,115 435,266 502,230 652,899 1,088,165 1,305,798 2,176,330 3,264,495 6,528,990

Collatz Trajectory (209 steps to reach 1)

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

6,528,990 3,264,495 9,793,486 4,896,743 14,690,230 7,345,115 22,035,346 11,017,673 33,053,020 16,526,510 8,263,255 24,789,766 12,394,883 37,184,650 18,592,325 55,776,976 27,888,488 13,944,244 6,972,122 3,486,061 10,458,184 5,229,092 2,614,546 1,307,273 3,921,820 1,960,910 980,455 2,941,366 1,470,683 4,412,050 2,206,025 6,618,076 3,309,038 1,654,519 4,963,558 2,481,779 7,445,338 3,722,669 11,168,008 5,584,004 2,792,002 1,396,001 4,188,004 2,094,002 1,047,001 3,141,004 1,570,502 785,251 2,355,754 1,177,877 3,533,632 1,766,816 883,408 441,704 220,852 110,426 55,213 165,640 82,820 41,410

← Previous Integer #6,528,989 Browse Full Index Next Integer #6,528,991 →