6,065,760

2⁵ × 3 × 5 × 12637

6,065,760 factors as 2^5 × 3 × 5 × 12637. Its 48 positive divisors give a proper-divisor sum of 13,042,896, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 5 × 12637

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 19,108,656

Proper Divisor Sum 13,042,896

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6065747 ← → #6065771

Radix Representation

Decimal	6065760
Binary	10111001000111001100000 (23 bits)
Octal	0o27107140
Hexadecimal	0x5C8E60

Divisor Catalog (48)

1 2 3 4 5 6 8 10 12 15 16 20 24 30 32 40 48 60 80 96 120 160 240 480 12,637 25,274 37,911 50,548 63,185 75,822 101,096 126,370 151,644 189,555 202,192 252,740 303,288 379,110 404,384 505,480 606,576 758,220 1,010,960 1,213,152 1,516,440 2,021,920 3,032,880 6,065,760

Collatz Trajectory (90 steps to reach 1)

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

6,065,760 3,032,880 1,516,440 758,220 379,110 189,555 568,666 284,333 853,000 426,500 213,250 106,625 319,876 159,938 79,969 239,908 119,954 59,977 179,932 89,966 44,983 134,950 67,475 202,426 101,213 303,640 151,820 75,910 37,955 113,866 56,933 170,800 85,400 42,700 21,350 10,675 32,026 16,013 48,040 24,020 12,010 6,005 18,016 9,008 4,504 2,252 1,126 563 1,690 845 2,536 1,268 634 317 952 476 238 119 358 179

← Previous Integer #6,065,759 Browse Full Index Next Integer #6,065,761 →