7,509,780

2² × 3³ × 5 × 13907

7,509,780 factors as 2^2 × 3^3 × 5 × 13907. Its 48 positive divisors give a proper-divisor sum of 15,855,660, so this integer is abundant. The Collatz stopping time is 54 steps.

Prime Factor Structure

Factorization String 2^2 × 3^3 × 5 × 13907

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 23,365,440

Proper Divisor Sum 15,855,660

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #7509743 ← → #7509787

Radix Representation

Decimal	7509780
Binary	11100101001011100010100 (23 bits)
Octal	0o34513424
Hexadecimal	0x729714

Divisor Catalog (48)

1 2 3 4 5 6 9 10 12 15 18 20 27 30 36 45 54 60 90 108 135 180 270 540 13,907 27,814 41,721 55,628 69,535 83,442 125,163 139,070 166,884 208,605 250,326 278,140 375,489 417,210 500,652 625,815 750,978 834,420 1,251,630 1,501,956 1,877,445 2,503,260 3,754,890 7,509,780

Collatz Trajectory (54 steps to reach 1)

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

7,509,780 3,754,890 1,877,445 5,632,336 2,816,168 1,408,084 704,042 352,021 1,056,064 528,032 264,016 132,008 66,004 33,002 16,501 49,504 24,752 12,376 6,188 3,094 1,547 4,642 2,321 6,964 3,482 1,741 5,224 2,612 1,306 653 1,960 980 490 245 736 368 184 92 46 23 70 35 106 53 160 80 40 20 10 5 16 8 4 2 1

← Previous Integer #7,509,779 Browse Full Index Next Integer #7,509,781 →