6,629,260

2² × 5 × 11 × 30133

6,629,260 factors as 2^2 × 5 × 11 × 30133. Its 24 positive divisors give a proper-divisor sum of 8,558,276, so this integer is abundant. The Collatz stopping time is 72 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 11 × 30133

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 15,187,536

Proper Divisor Sum 8,558,276

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #6629251 ← → #6629279

Radix Representation

Decimal	6629260
Binary	11001010010011110001100 (23 bits)
Octal	0o31223614
Hexadecimal	0x65278C

Divisor Catalog (24)

1 2 4 5 10 11 20 22 44 55 110 220 30,133 60,266 120,532 150,665 301,330 331,463 602,660 662,926 1,325,852 1,657,315 3,314,630 6,629,260

Collatz Trajectory (72 steps to reach 1)

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

6,629,260 3,314,630 1,657,315 4,971,946 2,485,973 7,457,920 3,728,960 1,864,480 932,240 466,120 233,060 116,530 58,265 174,796 87,398 43,699 131,098 65,549 196,648 98,324 49,162 24,581 73,744 36,872 18,436 9,218 4,609 13,828 6,914 3,457 10,372 5,186 2,593 7,780 3,890 1,945 5,836 2,918 1,459 4,378 2,189 6,568 3,284 1,642 821 2,464 1,232 616 308 154 77 232 116 58 29 88 44 22 11 34

← Previous Integer #6,629,259 Browse Full Index Next Integer #6,629,261 →